Abstract
Lattice-free sets and their applications for cutting-plane methods in mixedinteger optimization have been studied in recent literature. The family of all integral lattice-free polyhedra that are not properly contained in another integral lattice-free polyhedron has been of particular interest. We call these polyhedra ℤd-maximal. For fixed d, the family of ℤd-maximal integral lattice-free polyhedra is finite up to unimodular equivalence. In view of possible applications in cutting-plane theory, one would like to have a classification of this family. This is a challenging task already for small dimensions. In contrast, the subfamily of all integral lattice-free polyhedra that are not properly contained in any other lattice-free set, which we call ℝd-maximal lattice-free polyhedra, allow a rather simple geometric characterization. Hence, the question was raised for which dimensions the notions of ℤd-maximality and ℝd-maximality are equivalent. This was known to be the case for dimensions one and two. On the other hand, for d ≥ 4 there exist integral lattice-free polyhedra that are ℤd-maximal but not ℤd-maximal. We consider the remaining case d = 3 and prove that for integral lattice-free polyhedra the notions of ℝ3-maximality and ℤ3-maximality are equivalent. This allows to complete the classification of all ℤ3-maximal integral lattice-free polyhedra.
| Original language | English |
|---|---|
| Pages (from-to) | 1035-1062 |
| Number of pages | 28 |
| Journal | Mathematics of Operations Research |
| Volume | 42 |
| Issue number | 4 |
| DOIs | |
| State | Published - Nov 2017 |
| Externally published | Yes |
Keywords
- Classification
- Cutting planes
- Integral polyhedra
- Lattice-free sets
- Mixed-integer optimization
Fingerprint
Dive into the research topics of 'Notions of maximality for integral lattice-free polyhedra: The case of dimension three'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver