Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions

Britta Schulze (), Kathrin Klamroth () and Michael Stiglmayr ()
Additional contact information
Britta Schulze: University of Wuppertal
Kathrin Klamroth: University of Wuppertal
Michael Stiglmayr: University of Wuppertal

Journal of Global Optimization, 2019, vol. 74, issue 3, No 5, 495-522

Abstract: Abstract The multi-objective unconstrained combinatorial optimization problem (MUCO) can be considered as an archetype of a discrete linear multi-objective optimization problem. It can be interpreted as a specific relaxation of any multi-objective combinatorial optimization problem with linear sum objective function. While its single criteria analogon is analytically solvable, MUCO shares the computational complexity issues of most multi-objective combinatorial optimization problems: intractability and NP-hardness of the $$\varepsilon $$ ε -constraint scalarizations. In this article interrelations between the supported points of a MUCO problem, arrangements of hyperplanes and a weight space decomposition, and zonotopes are presented. Based on these interrelations and a result by Zaslavsky on the number of faces in an arrangement of hyperplanes, a polynomial bound on the number of extreme supported solutions can be derived, leading to an exact polynomial time algorithm to find all extreme supported solutions. It is shown how this algorithm can be incorporated into a solution approach for multi-objective knapsack problems.

Keywords: Multi-objective combinatorial optimization; Multi-objective unconstrained optimization; Weight space decomposition; Arrangement of hyperplanes; Zonotopes; Knapsack problem (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-019-00745-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:74:y:2019:i:3:d:10.1007_s10898-019-00745-6

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-019-00745-6

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().