In this paper, we provide a mixed-integer programming approach for solving the problem of minimizing a real-valued function over the efficient set of a multiple objective linear program problem. Instead of solving the problem directly, we introduce a new problem of minimizing the objective function subject to some linear constraints with additional binary variables. We show under certain conditions that the two problems are equivalent. When the objective function of the original problem is a linear or convex function, the new problem is a linear or convex programming problem, respectively, with some binary variables. These problems can be solved as mixed-integer programs with current state-of-art mixed-integer programming solvers.
['Erjiang Sun']
On Optimization Over the Efficient Set of a Multiple Objective Linear Programming Problem