Note on prime representations of convex polyhedral sets

DOI10.1007/BF00940849MaRDI QIDQ1102183zbMATH OpenOpenAlexFDO

Authors F. W. Lemire, Arnon Boneh, Richard J. Caron, J. Fred McDonald, Jan Telgen, Ton Vorst

Publication date 1989

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00940849

zbMATH Keywords

redundancysystem of linear inequalitiesminimal representationprime representationconvex polyhedral set

Mathematics Subject Classification ID

Linear programming (90C05) Polytopes and polyhedra (52Bxx)

Recommendations

• Polynomial representations of polyhedra
• scientific article; zbMATH DE number 1860737
• Polynomial inequalities representing polyhedra
• scientific article; zbMATH DE number 5956571
• A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions

Cites work

• A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
• Convex Analysis
• Minimal representation of convex polyhedral sets
• Redundancy in mathematical programming. A state-of-the-art survey

Cited in

(6)

• On minimal generators for semi-closed polyhedra
• Analytic centers and repelling inequalities
• Fully piecewise linear vector optimization problems
• A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions
• Consistency, redundancy, and implied equalities in linear systems
• Minimal representations of a face of a convex polyhedron and some applications

This page was built for publication: Note on prime representations of convex polyhedral sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102183)