Note on prime representations of convex polyhedral sets

From MaRDI portal





Consider a convex polyhedral set represented by a system of linear inequalities. A prime representation of the polyhedron is one that contains no redundant constraints. We present a sharp upper bound on the difference between the cardinalities of any two primes.











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)