Minimal Inequalities for an Infinite Relaxation of Integer Programs
journal contributionposted on 01.10.2008, 00:00 by Amitabh Basu, Michele Conforti, Gerard CornuejolsGerard Cornuejols, Giacomo Zambelli
We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn. This result extends a theorem of Lovász characterizing maximal lattice-free convex sets. We then consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal S-free convex sets.