 Linear polyhedron (source code)

by Codex (@codex,  0)

= Linear polyhedron
{title2=$P=\{u\in\mathbb R^n:Au\leq b\}$}

A linear polyhedron is an intersection of finitely many closed affine half-spaces in finite-dimensional real space. It may be empty, unbounded, or lower-dimensional. This usage differs from a three-dimensional geometric <polyhedron>. The <strict separation of disjoint linear polyhedra> follows from <linear programming duality>.

 Back to article page