Abstract
For a polytope P, the Chvátal closure P′ ⊆ P is obtained by simultaneously strengthening all feasible inequalities cx ≤ β (with integral c) to \(cx \leq \lfloor\beta\rfloor\). The number of iterations of this procedure that are needed until the integral hull of P is reached is called the Chvátal rank. If P ⊆ [0,1]n, then it is known that O(n 2 logn) iterations always suffice (Eisenbrand and Schulz (1999)) and at least \((1+\frac{1}{e}-o(1))n\) iterations are sometimes needed (Pokutta and Stauffer (2011)), leaving a huge gap between lower and upper bounds.
We prove that there is a polytope contained in the 0/1 cube that has Chvátal rank Ω(n 2), closing the gap up to a logarithmic factor. In fact, even a superlinear lower bound was mentioned as an open problem by several authors. Our choice of P is the convex hull of a semi-random Knapsack polytope and a single fractional vertex. The main technical ingredient is linking the Chvátal rank to simultaneous Diophantine approximations w.r.t. the ∥ · ∥ 1-norm of the normal vector defining P.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems 6, 466–486 (1985)
Balas, E., Ceria, S., Cornuéjols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58, 295–324 (1993)
Bockmayr, A., Eisenbrand, F., Hartmann, M.E., Schulz, A.S.: On the Chvátal rank of polytopes in the 0/1 cube. Dis. App. Math. 98(1-2), 21–27 (1999)
Chvátal, V., Cook, W., Hartmann, M.: On cutting-plane proofs in combinatorial optimization. Linear Algebra and its Applications 114-115, 455–499 (1989); Special Issue Dedicated to A.J. Hoffman
Chlamtáč, E., Tulsiani, M.: Convex relaxations and integrality gaps. In: Handbook on Semidefinite, Cone and Polynomial Optimization (2011)
Dadush, D., Dey, S.S., Vielma, J.P.: The Chvátal-Gomory closure of a strictly convex body. Math. Oper. Res. 36(2), 227–239 (2011)
Dadush, D., Dey, S.S., Vielma, J.P.: On the Chvátal-Gomory Closure of a Compact Convex Set. In: Günlük, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 130–142. Springer, Heidelberg (2011)
Dunkel, J., Schulz, A.S.: The Gomory-Chvátal closure of a non-rational polytope is a rational polytope (2010), http://www.optimization-online.org/DB_HTML/2010/11/2803.html
Eisenbrand, F.: On the membership problem for the elementary closure of a polyhedron. Combinatorica 19(2), 297–300 (1999)
Eisenbrand, F., Schulz, A.S.: Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 137–150. Springer, Heidelberg (1999)
Eisenbrand, F., Schulz, A.S.: Bounds on the Chvátal rank of polytopes in the 0/1-cube. Combinatorica 23(2), 245–261 (2003)
Lasserre, J.B.: An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 293–303. Springer, Heidelberg (2001)
Lasserre, J.: Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization 11(3), 796–817 (2001)
Laurent, M.: A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0-1 programming. Math. Oper. Res. 28(3), 470–496 (2003)
Lovász, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization 1, 166–190 (1991)
Pokutta, S., Schulz, A.S.: Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank. Oper. Res. Lett. 39(6), 457–460 (2011)
Pokutta, S., Stauffer, G.: Lower bounds for the Chvátal-Gomory rank in the 0/1 cube. Oper. Res. Lett. 39(3), 200–203 (2011)
Sherali, H., Adams, W.: A hierarchy of relaxation between the continuous and convex hull representations. SIAM J. Dis. Math. 3, 411–430 (1990)
Schrijver, A.: On cutting planes. Annals of Discrete Mathematics 9, Combinatorics 79, Part II, 291–296 (1980)
Singh, M., Talwar, K.: Improving Integrality Gaps via Chvátal-Gomory Rounding. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010. LNCS, vol. 6302, pp. 366–379. Springer, Heidelberg (2010)
Ziegler, G.M.: Lectures on 0/1-polytopes. In: Polytopes—combinatorics and computation (Oberwolfach, 1997). DMV Sem., vol. 29, pp. 1–41. Birkhäuser, Basel (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rothvoß, T., Sanitá, L. (2013). 0/1 Polytopes with Quadratic Chvátal Rank. In: Goemans, M., Correa, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2013. Lecture Notes in Computer Science, vol 7801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36694-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-36694-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36693-2
Online ISBN: 978-3-642-36694-9
eBook Packages: Computer ScienceComputer Science (R0)