Upper Bound on the Number of Vertices of Polyhedra with 0,1-Constraint Matrices
classification
💻 cs.CG
keywords
constraintnumberverticesboundmathbbmatricesmatrixmaximum
read the original abstract
In this note we show that the maximum number of vertices in any polyhedron $P=\{x\in \mathbb{R}^d : Ax\leq b\}$ with $0,1$-constraint matrix $A$ and a real vector $b$ is at most $d!$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.