Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

On Polyhedral Projection and Parametric Programming

Author(s):

C.N. Jones, E.C. Kerrigan, Jan M. Maciejowski
Conference/Journal:

Journal of Optimization Theory and Applications, vol. 138, no. 2
Abstract:

This note brings together two fundamental topics: polyhedral projection and parametric linear programming. First, it is shown that given a parametric linear program (pLP), a polyhedron exists whose projection provides the solution to the pLP. Second, the converse is tackled and it is shown how to formulate a pLP whose solution is the projection of an appropriately defined polyhedron described as the intersection of a finite number of halfspaces. The input to one operation can be converted to an input of the other operation and the resulting output can be converted back to the desired form in polynomial time - this implies that algorithms for computing projections or methods for solving parametric linear programs can be applied to either problem class.

Year:

2008
Type of Publication:

(01)Article
Supervisor:

M. Morari

File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@Article { JonKer:2008:IFA_2968,
    author={C.N. Jones and E.C. Kerrigan and Jan M. Maciejowski},
    title={{On Polyhedral Projection and Parametric Programming}},
    journal={Journal of Optimization Theory and Applications},
    year={2008},
    volume={138},
    number={2},
    pages={},
    month=apr,
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=2968}
}
Permanent link