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...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical methods of operations research (Heidelberg, Germany) Vol. 84; no. 2; pp. 411 - 426
Main Authors:	Lohne, Andreas, Weising, Benjamin
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2016 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!