Tightening bilinear relaxations using geometric rotation
A classical approach for handling non-convex optimization problems involving bilinear terms is to approximate the bilinear expressions using McCormick relaxations. Such relaxations are central to global optimization methods, with the spatial branch-and-bound (sBB) algorithm being one of the most widely used approaches. In the spatial branching step, the algorithm partitions the feasible region using axis-aligned … Read more