A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes

The Perspective Reformulation generates tight approximations to MINLP problems with semicontinuous variables. It can be implemented either as a Second-Order Cone Program, or as a Semi-Infinite Linear Program. We compare the two reformulations on two MIQPs in the context of exact or approximate Branch-and-Cut algorithms.