Note on prime representations of convex polyhedral sets

DOI10.1007/BF00940849zbMath0643.90049OpenAlexW2117398013MaRDI QIDQ1102183

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

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

redundancyminimal representationsystem of linear inequalitiesprime representationconvex polyhedral set

Mathematics Subject Classification ID

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

Related Items (5)

Consistency, redundancy, and implied equalities in linear systems ⋮ Minimal representations of a face of a convex polyhedron and some applications ⋮ Fully piecewise linear vector optimization problems ⋮ On minimal generators for semi-closed polyhedra ⋮ Analytic centers and repelling inequalities

Cites Work

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

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