Lifting properties of maximal lattice-free polyhedra

被引:0
作者
Gennadiy Averkov
Amitabh Basu
机构
[1] University of Magdeburg,Institute of Mathematical Optimization, Faculty of Mathematics
[2] The Johns Hopkins University,Department of Applied Mathematics and Statistics
来源
Mathematical Programming | 2015年 / 154卷
关键词
90C10; 90C11; 52C07; 52C22; 52B12;
D O I
暂无
中图分类号
学科分类号
摘要
We study the uniqueness of minimal liftings of cut-generating functions obtained from maximal lattice-free polyhedra. We prove a basic invariance property of unique minimal liftings for general maximal lattice-free polyhedra. This generalizes a previous result by Basu et al. (Math Oper Res 37(2):346–355, 2012) for simplicial maximal lattice-free polytopes, thus completely settling this fundamental question about lifting for maximal lattice-free polyhedra. We further give a very general iterative construction to get maximal lattice-free polyhedra with the unique-lifting property in arbitrary dimensions. This single construction not only obtains all previously known polyhedra with the unique-lifting property, but goes further and vastly expands the known list of such polyhedra. Finally, we extend characterizations from Basu et al. (2012) about lifting with respect to maximal lattice-free simplices to more general polytopes. These nontrivial generalizations rely on a number of results from discrete geometry, including the Venkov-Alexandrov-McMullen theorem on translative tilings and characterizations of zonotopes in terms of central symmetry of their faces.
引用
收藏
页码:81 / 111
页数:30
相关论文
共 42 条
  • [1] Averkov G(2012)On finitely generated closures in the theory of cutting planes Discrete Optim. 9 209-215
  • [2] Averkov G(2013)A proof of Lovász’s theorem on maximal lattice-free sets Beitr. Algebra Geom. 54 105-109
  • [3] Averkov G(2011)Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three Math. Oper. Res. 36 721-742
  • [4] Wagner Ch(2013)Unique lifting of integer variables in minimal inequalities Math. Program. Ser. A 141 561-576
  • [5] Weismantel R(2010)Maximal lattice-free convex sets in linear subspaces Math. Oper. Res. 35 704-720
  • [6] Basu A(2012)Unique minimal liftings for simplicial polytopes Math. Oper. Res. 37 346-355
  • [7] Campêlo M(2013)A (k+1)-slope theorem for the k-dimensional infinite group relaxation SIAM J. Optim. 23 1021-1040
  • [8] Conforti M(2011)Corner polyhedra and intersection cuts Surv. Oper. Res. Manag. Sci. 16 105-120
  • [9] Cornuéjols G(2011)A geometric perspective on lifting Oper. Res. 59 569-577
  • [10] Zambelli G(1973)Convexity in crystallographic lattices J. Geom. 3 71-85