2000 character limit reached
Multi-Objective Mixed Integer Programming: An Objective Space Algorithm (1909.03829v1)
Published 9 Sep 2019 in math.OC and cs.DS
Abstract: This paper introduces the first objective space algorithm which can exactly find all supported and non-supported non-dominated solutions to a mixed-integer multi-objective linear program with an arbitrary number of objective functions. This algorithm is presented in three phases. First it builds up a super-set which contains the Pareto front. This super-set is then modified to not contain any intersecting polytopes. Once this is achieved, the algorithm efficiently calculates which portions of the super-set are not part of the Pareto front and removes them, leaving exactly the Pareto front.