Scaling problems in linear-fractional programming.
Solution of a fractional combinatorial optimization problem by mixed integer programming
Fractionnal mathematical programs appear in numerous operations research, computer science and economic domains. We consider in this paper the problem of maximizing the sum of 0–1 hyperbolic ratios (SRH). In contrast to the single ratio problem, there has been little work in the literature concerning this problem. We propose two mixed-integer linear programming formulations of SRH and develop two different strategies to solve them. The first one consists in using directly a general-purpose mixed-integer...
Structure of efficient sets for strictly quasi convex objectives.