Optimization Online


On the Existence of Ideal Solutions in Multi-objective 0-1 Integer Programs

Natashia Boland(natashia.boland***at***isye.gatech.edu )
Hadi Charkhgard(hcharkhgard***at***usf.edu)
Martin Savelsbergh(martin.savelsbergh***at***isye.gatech.edu )

Abstract: We study conditions under which the objective functions of a multi-objective 0-1 integer linear program guarantee the existence of an ideal point, meaning the existence of a feasible solution that simultaneously minimizes all objectives. In addition, we study the complexity of recognizing whether a set of objective functions satisfies these conditions: we show that it is NP-hard, but can be solved in pseudo-polynomial time. Few multi-objective 0-1 integer programs have objectives satisfying the conditions for the existence of an ideal point, but the conditions may be satisfied for a subset of the objective functions and/or be satisfied when the objective functions are restricted to a subset of the variables. We illustrate how such occurrences can be exploited to reduce the number of objective functions and/or to derive cuts in the space of the decision variables.

Keywords: Multi-objective 0-1 integer linear program, ideal point, nondominated frontier, computational complexity

Category 1: Other Topics (Multi-Criteria Optimization )

Category 2: Integer Programming (0-1 Programming )


Download: [PDF]

Entry Submitted: 07/25/2016
Entry Accepted: 07/25/2016
Entry Last Modified: 07/25/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society