Unique Minimal Liftings for Simplicial Polytopes
- 1 May 2012
- journal article
- research article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 37 (2) , 346-355
Abstract
For a minimal inequality derived from a maximal lattice-free simplicial polytope in ℝn, we investigate the region where minimal liftings are uniquely defined, and we characterize when this region covers ℝn. We then use this characterization to show that a minimal inequality derived from a maximal lattice-free simplex in ℝn with exactly one lattice point in the relative interior of each facet has a unique minimal lifting if and only if all the vertices of the simplex are lattice points.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Intersection Cuts with Infinite Split RankMathematics of Operations Research, 2012
- A Geometric Perspective on LiftingOperations Research, 2011
- Maximal Lattice-Free Convex Sets in Linear SubspacesMathematics of Operations Research, 2010
- On Lifting Integer Variables in Minimal InequalitiesLecture Notes in Computer Science, 2010
- Minimal Valid Inequalities for Integer ConstraintsMathematics of Operations Research, 2009
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles2008