10.1184/R1/6706727.v1
Amitabh Basu
Amitabh
Basu
Michele Conforti
Michele
Conforti
Gerard Cornuejols
Gerard
Cornuejols
Giacomo Zambelli
Giacomo
Zambelli
Maximal Lattice-Free Convex Sets in Linear Subspaces
Carnegie Mellon University
2005
Business
Management
2005-01-01 00:00:00
Journal contribution
https://kilthub.cmu.edu/articles/journal_contribution/Maximal_Lattice-Free_Convex_Sets_in_Linear_Subspaces/6706727
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 R<sup>n</sup>