Maximal Lattice-Free Convex Sets in Linear Subspaces
Published Online:1 Aug 2010https://doi.org/10.1287/moor.1100.0461
Abstract
We consider a model that arises in integer programming and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also show that these sets are polyhedra. The latter result extends a theorem of Lovász characterizing maximal lattice-free convex sets in ℝn.
