Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming

Let a polyhedral convex set be given by a finite number of linear inequalities and consider the problem to project this set onto a subspace. This problem, called polyhedral projection problem, is shown to be equivalent to multiple objective linear programming. The number of objectives of the multipl...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical methods of operations research (Heidelberg, Germany) Jg. 84; H. 2; S. 411 - 426
Hauptverfasser:	Lohne, Andreas, Weising, Benjamin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2016 Springer Nature B.V
Schlagworte:	Business and Management Calculus of Variations and Optimal Control; Optimization Equivalence Inequalities Linear programming Mathematical analysis Mathematics Mathematics and Statistics Multiple objective Operations research Operations Research/Decision Theory Optimization Order disorder Original Article Polyhedra Projection Studies Vectors (mathematics) Irredundant solution Representation of polyhedra 52B55 15A39 Vector linear programming 90C29 Linear vector optimization Multi-objective optimization 90C05
ISSN:	1432-2994, 1432-5217
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!