On finitely generated closures in the theory of cutting planes
Optimization and Control
2012-08-21 v3 Combinatorics
Metric Geometry
Abstract
Let be a rational polyhedron in and let be a class of -dimensional maximal lattice-free rational polyhedra in . For by we denote the convex hull of points belonging to but not to the interior of . Andersen, Louveaux and Weismantel showed that if the so-called max-facet-width of all is bounded from above by a constant independent of , then 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 . The presented results are motivated by applications in cutting-plane theory from mixed-integer optimization.
Keywords
Cite
@article{arxiv.1110.3967,
title = {On finitely generated closures in the theory of cutting planes},
author = {Gennadiy Averkov},
journal= {arXiv preprint arXiv:1110.3967},
year = {2012}
}
Comments
accepted in Discrete Optimization