Note on prime representations of convex polyhedral sets

DOI10.1007/BF00940849zbMATH Open0643.90049OpenAlexW2117398013MaRDI QIDQ1102183FDOQ1102183

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

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

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

zbMATH Keywords

redundancysystem of linear inequalitiesminimal representationprime representationconvex polyhedral set

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• 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
• On minimal generators for semi-closed polyhedra

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)