Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/32861In 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!$.3 pagesComputational GeometryG.1.6Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matricestext