Hyperbolic Optimization over the Integer Efficient Set of MOILFP
The aim of this study is to find the optimum of a linear fractional function over the efficient set of a multi-objective linear fractional integer program without generating all efficient solutions. By its nature, it is a global optimization problem since the efficient set is discrete, hence not convex. For this purpose, a branch and bound based method is described with a double mission to search for an optimal solution for a given linear fractional function which is moreover, efficient for a multi-objective linear fractional integer programming problem. Tests performed on instances randomly generated up to 120 variables, 100 constraints and 6 criteria are successful.
math.OC↗