Work

Multi-objective mixed integer programming: An objective space algorithm

Year: 2019

Type: conference-paper

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.

Source: AIP conference proceedings

DOI: 10.1063/1.5090006

Authors: William Pettersson, Melih Ozlen

Institutions: University of Glasgow, RMIT University

Language: English

Topic: Advanced Multi-Objective Optimization Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Engineering and Physical Sciences Research Council

Award: IP-MATCH: Integer Programming for Large and Complex Matching Problems