Skip to main content
Article thumbnail
Location of Repository

Minimal inequalities for an infinite relaxation of integer programs

By Amitabh Basu, Michele Conforti, Gérard Cornuéjols and 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 Lovasz 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

Topics: QA Mathematics
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
DOI identifier: 10.1137/090756375
OAI identifier:
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.