On finitely generated closures in the theory of cutting planes

preprint2012arXivOpen access

Abstract

Let PP be a rational polyhedron in Rd\mathbb{R}^d and let L\mathcal{L} be a class of dd-dimensional maximal lattice-free rational polyhedra in Rd\mathbb{R}^d. For L∈LL \in \mathcal{L} by RL(P)R_L(P) we denote the convex hull of points belonging to PP but not to the interior of LL. Andersen, Louveaux and Weismantel showed that if the so-called max-facet-width of all L∈LL \in \mathcal{L} is bounded from above by a constant independent of LL, then ⋂L∈LRL(P)\bigcap_{L\in \mathcal{L}} R_L(P) is a rational polyhedron. We give a short proof of a generalization of this result. We also give a characterization for the boundedness of the max-facet-width on L\mathcal{L}. The presented results are motivated by applications in cutting-plane theory from mixed-integer optimization.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.