Maximal Lattice-Free Convex Sets in Linear Subspaces
Maximal Lattice-Free Convex Sets in Linear Subspaces
复制标题
DOI：
10.1287/moor.1100.0461
复制
发表时间：
2010-08-01
影响因子：
1.7
通讯作者：
Zambelli, Giacomo
中科院分区：
文献类型：
--
作者：
Basu, Amitabh;Conforti, Michele;Zambelli, Giacomo
我们考虑了整数规划中的一个模型，证明了所有的不冗余不等式都是由仿射子空间中的极大无格凸集得到的。我们也证明了这些集合是多面体。后一个结果推广了Lovasz刻画R-n中极大无格凸集的定理。
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.