The Chvátal-Gomory closure of an ellipsoid is a polyhedron

11Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It is well-know that the Chvátal-Gomory (CG) closure of a rational polyhedron is a rational polyhedron. In this paper, we show that the CG closure of a bounded full-dimensional ellipsoid, described by rational data, is a rational polytope. To the best of our knowledge, this is the first extension of the polyhedrality of the CG closure to a non-polyhedral set. A key feature of the proof is to verify that all non-integral points on the boundary of ellipsoids can be separated by some CG cut. Given a point u on the boundary of an ellipsoid that cannot be trivially separated using the CG cut parallel to its supporting hyperplane, the proof constructs a sequence of CG cuts that eventually separates u. The polyhedrality of the CG closure is established using this separation result and a compactness argument. The proof also establishes some sufficient conditions for the polyhedrality result for general compact convex sets. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Dey, S. S., & Vielma, J. P. (2010). The Chvátal-Gomory closure of an ellipsoid is a polyhedron. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6080 LNCS, pp. 327–340). https://doi.org/10.1007/978-3-642-13036-6_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free