Maximal Lattice-Free Convex Sets in Linear Subspaces

• 成果类型: Article
• 署名作者: Basu, Amitabh; Conforti, Michele; Cornuejols, Gerard; Zambelli, Giacomo
• 署名单位: Carnegie Mellon University; University of Padua
• 刊物名称: MATHEMATICS OF OPERATIONS RESEARCH
• ISSN/ISSBN: 0364-765X
• DOI: 10.1287/moor.1100.0461
• 发表日期: 2010
• 页码: 704-720
• 关键词: simplex tableau; cutting planes; integer; inequalities; variables; rows; cuts

摘要

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 Lovasz characterizing maximal lattice-free convex sets in R-n.