|[ < ]||[ > ]||[ << ]||[ Up ]||[ >> ]||[Top]||[Contents]||[Index]||[ ? ]|
Using strict inequalities can be done by introducing a second special variable \epsilon, which satisfies \epsilon >= 0. A polyhedron is then empty if its intersection with the half-space \epsilon > 0 is empty, or in other words, if there is no vertex whose coefficient associated to \epsilon is strictly positive. The inclusion test need also a (more complicated) adaptation.