An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems

In this paper, we present an outer approximation algorithm for computing the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems (MOMILPs). It produces the extreme points (i.e., the vertices) as well as the facets of the Edgeworth–Pareto hull. We note that these extreme points are the extreme supported non-dominated points of a MOMILP. We also show how to extend the concept of geometric duality for multi-objective linear programming problems to the Edgeworth–Pareto hull of MOMILPs and use this extension to develop the algorithm. The algorithm relies on a novel oracle that solves single-objective weighted-sum problems and we show that the required number of oracle calls is polynomial in the number of facets of the convex hull of the extreme supported non-dominated points in the case of MOMILPs. Thus, for MOMILPs for which the weighted-sum problem is solvable in polynomial time, the facets can be computed with incremental-polynomial delay—a result that was formerly only known for the computation of extreme supported non-dominated points. Our algorithm can be an attractive option to compute lower bound sets within multi-objective branch-and-bound algorithms for solving MOMILPs. This is for several reasons as (i) the algorithm starts from a trivial valid lower bound set then iteratively improves it, thus at any iteration of the algorithm a lower bound set is available; (ii) the algorithm also produces efficient solutions (i.e., solutions in the decision space); (iii) in any iteration of the algorithm, a relaxation of the MOMILP can be solved, and the obtained points and facets still provide a valid lower bound set. Moreover, for the special case of multi-objective linear programming problems, the algorithm solves the problem to global optimality. A computational study on a set of benchmark instances from the literature is provided.