Maximal lattice-free convex sets in linear subspaces

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 ${\mathbb{R}}^n$.

Cited by in corpus (2)

• A geometric approach to cut-generating functions
• Unique lifting of integer variables in minimal inequalities