Lattice-free sets (convex subsets of without interior integer points) and their applications for cutting-plane methods in mixed-integer optimization have been studied in recent literature. Notably, the family of all integral lattice-free polyhedra which are not properly contained in another integral lattice-free polyhedron has been of particular interest. We call these polyhedra -maximal. It is known that, for fixed , the family -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. However, this turns out to be a challenging task already for small dimensions. In contrast, the subfamily of all integral lattice-free polyhedra which are not properly contained in any other lattice-free set, which we call -maximal lattice-free polyhedra, allow a rather simple geometric characterization. Hence, the question was raised for which dimensions the notions of -maximality and -maximality are equivalent. This was known to be the case for dimensions one and two. On the other hand, Nill and Ziegler (2011) showed that for dimension , there exist polyhedra which are -maximal but not -maximal. In this article, we consider the remaining case and prove that for integral polyhedra the notions of -maximality and -maximality are equivalent. As a consequence, the classification of all -maximal integral polyhedra by Averkov, Wagner and Weismantel (2011) contains all -maximal integral polyhedra.

生成讲解博客的中文版本

生成AI智能校验的中文版本