%0 Journal Article %A Basu, Amitabh %A Conforti, Michele %A Cornuejols, Gerard %A Zambelli, Giacomo %D 2005 %T Maximal Lattice-Free Convex Sets in Linear Subspaces %U https://kilthub.cmu.edu/articles/journal_contribution/Maximal_Lattice-Free_Convex_Sets_in_Linear_Subspaces/6706727 %R 10.1184/R1/6706727.v1 %2 https://kilthub.cmu.edu/ndownloader/files/12235754 %K Business %K Management %X 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 %I Carnegie Mellon University