Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations

Abstract

This paper focuses on methods that improve the performance of solution approaches for multiple-ratio fractional 0–1 programs (FPs) in their general structure. In particular, we explore the links between equivalent mixed-integer linear programming and conic quadratic programming reformulations of FPs. Thereby, we show that integrating the ideas behind these two types of reformulations of FPs allows us to push further the limits of the current state-of-the-art results and tackle larger-size problems. We perform extensive computational experiments to compare the proposed approaches against the current reformulations from the literature.