Date of Original Version

3-30-2009

Type

Working Paper

Rights Management

All Rights Reserved

Abstract or Description

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 Rn

Share

COinS