International Transactions in Operational Research

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

Early View

Abstract In this paper, we develop two algorithms to optimize a linear function over the nondominated set of multiobjective 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 multiobjective combinatorial optimization problems and show that the algorithms work well.

Related Topics

Related Publications

Related Content

Site Footer


This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.