Optimizing a linear function over the nondominated set of multiobjective integer programs

Research output: Contribution to journalArticlepeer-review

41 Downloads (Pure)

Abstract

In this paper, we develop two algorithms to optimize a linear function over the nondominated set of multi-objective integer programs. The algorithms iteratively generate nondominated points and converge to the optimal solution reducing the feasible set. The first algorithm proposes improvements to an existing algorithm employing a decomposition and search procedure in finding a new point. Differently, the second algorithm maximizes one of the criteria throughout the algorithm and generates new points by setting bounds on the linear function value. The decomposition and search procedure in the algorithms is accompanied by problem-specific mechanisms in order to explore the objective function space efficiently. The algorithms are designed to produce solutions that meet a prespecified accuracy level. We conduct experiments on multi-objective combinatorial optimization problems and show that the algorithms work well.
Original languageEnglish
Number of pages21
JournalInternational Transactions in Operational Research
Early online date20 Jan 2019
DOIs
Publication statusEarly online - 20 Jan 2019

Keywords

  • multiple objective programming
  • integer programming
  • nondominated set
  • combinatorial optimization

Fingerprint

Dive into the research topics of 'Optimizing a linear function over the nondominated set of multiobjective integer programs'. Together they form a unique fingerprint.

Cite this