Pareto Optima of Multicriteria Integer Linear Programs

We settle the computational complexity of fundamental questions related to multicriteria integer linear programs, when the dimensions of the strategy space and of the outcome space are considered fixed constants. In particular we construct: (1) polynomial-time algorithms to determine exactly the num...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:INFORMS journal on computing Ročník 21; číslo 1; s. 39
Hlavní autori: De Loera, Jesús A, Hemmecke, Raymond, Köppe, Matthias
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Linthicum Institute for Operations Research and the Management Sciences 22.12.2009
Predmet:
Hierarchies
Integer programming
Mathematical models
Pareto optimum
Studies
ISSN:1091-9856, 1091-9856
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We settle the computational complexity of fundamental questions related to multicriteria integer linear programs, when the dimensions of the strategy space and of the outcome space are considered fixed constants. In particular we construct: (1) polynomial-time algorithms to determine exactly the number of Pareto optima and Pareto strategies; (2) a polynomial-space polynomial-delay prescribed-order enumeration algorithm for arbitrary projections of the Pareto set; (3) a polynomial-time algorithm to minimize the distance of a Pareto optimum from a prescribed comparison point with respect to arbitrary polyhedral norms; and (4) a fully polynomial-time approximation scheme for the problem of minimizing the distance of a Pareto optimum from a prescribed comparison point with respect to the Euclidean norm. [PUBLICATION ABSTRACT]
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1091-9856
1091-9856
DOI:10.1287/ijoc.1080.0277