Unique Minimal Liftings for Simplicial Polytopes
Preprint
Abstract
For a minimal inequality derived from a maximal lattice-free simplicial polytope in $\R^n$, we investigate the region where minimal liftings are uniquely defined, and we characterize when this region covers $\R^n$. We then use this characterization to show that a minimal inequality derived from a maximal lattice-free simplex in $\R^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 7 references indexed in Scilit:
- Unique lifting of integer variables in minimal inequalitiesMathematical Programming, 2012
- 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