Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2015
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910306922397696 |
|---|---|
| author | Löhne, Andreas Weißing, Benjamin |
| author_facet | Löhne, Andreas Weißing, Benjamin |
| contents | 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 multiple objective linear program is by one higher than the dimension of the projected polyhedron. The result implies that an arbitrary vector linear program (with arbitrary polyhedral ordering cone) can be solved by solving a multiple objective linear program (i.e. a vector linear program with the standard ordering cone) with one additional objective space dimension. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1507_00228 |
| institution | arXiv |
| publishDate | 2015 |
| record_format | arxiv |
| spellingShingle | Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming Löhne, Andreas Weißing, Benjamin Optimization and Control 15A39, 52B55, 90C29, 90C05 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 multiple objective linear program is by one higher than the dimension of the projected polyhedron. The result implies that an arbitrary vector linear program (with arbitrary polyhedral ordering cone) can be solved by solving a multiple objective linear program (i.e. a vector linear program with the standard ordering cone) with one additional objective space dimension. |
| title | Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming |
| topic | Optimization and Control 15A39, 52B55, 90C29, 90C05 |
| url | https://arxiv.org/abs/1507.00228 |