Abstract
Eisenbrand and Schulz showed recently (IPCO 99) that the maximum Chvátal rank of a polytope in the [0,1]n cube is bounded above by O(n 2 logn) and bounded below by (1 + ∈)n for some ∈ < 0. It is well known that Chvátal’s cuts are equivalent to Gomory’s fractional cuts, which are themselves dominated by Gomory’s mixed integer cuts. What do these upper and lower bounds become when the rank is defined relative to Gomory’s mixed integer cuts? An upper bound of n follows from existing results in the literature. In this note, we show that the lower bound is also equal to n. We relate this result to bounds on the disjunctive rank and on the Lovász-Schrijver rank of polytopes in the [0,1]n cube. The result still holds for mixed 0,1 polyhedra with nn binary variables.
Supported by NSF grant DMI-9802773 and ONR grant N00014-97-1-0196.
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: cutting planes from logical conditions. In: Mangasarian, O., et al. (eds.): Nonlinear Programming, Vol. 2. Academic Press, New York (1975) 279–312
Balas, E.: Disjunctive programming. Annals of Discrete Mathematics 5 (1979) 3–51
Balas, E., Ceria, S., Cornu_ejols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming 58 (1993) 295–324
Balas, E., Perregaard, M.: A Precise correspondence between lift-and-project cuts, simple disjunctive cuts and mixed integer Gomory cuts for 0-1 programming. Management Science Research Report MSRR-631, Carnegie Mellon University (2000)
Chvátal, V.: Edmonds polytopes and a hierarchy of combinatorial optimization. Discrete Mathematics 4 (1973) 305–337
Chvátal, V., Cook, W., Hartmann, M.: On cutting-plane proofs in combinatorial optimization. Linear Algebra and its Applications 114/115 (1989) 455–499
Cook, W., Cunningham, W., Pullyblank, W., and Schrijver, A.: Combinatorial Optimization. John Wiley, New York (1998).
Cook, W., Dash, S.: On the matrix-cut rank of polyhedra. preprint, Department of Computational and Applied Mathematics, Rice University, Houston, Texas (1999), to appear in Mathematics of Operations Research.
Cook, W., Kannan, R., Schrijver, A.: Chvátal closures for mixed integer programming problems. Mathematical Programming 47 (1990) 155–174
Cornuéjols, G., Li, Y.: Elementary closures for integer programs. Operations Research Letters 28 (2001) 1–8
Eisenbrand, F., Schulz, A.: Bounds on the Chvátal rank of polytopes in the 0/1-cube. In: Cornu_ejols, G., et al, (eds.): Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, 1610 (1999) 137–150
Goemans, M., Tuncel, L.: When does the positive semidefiniteness constraint help in lifting procedures. preprint, Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada (2000), to appear in Mathematics of Operations Research.
Gomory, R.: An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Corporation (1960)
Li, Y.: Bounds on the ranks of polytopes in the 0/1-cube. research report, Carnegie Mellon University (2000), submitted.
Lovász, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM Journal of Optimization 1 (1991) 166–190
Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley and Sons, New York (1988)
Nemhauser, G., Wolsey, L.: A recursive procedure to generate all cuts for 0-1 mixed integer programs. Mathematical Programming 46 (1990) 379–390
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cornuéjols, G., Li, Y. (2001). On the Rank of Mixed 0,1 Polyhedra. In: Aardal, K., Gerards, B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2001. Lecture Notes in Computer Science, vol 2081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45535-3_6
Download citation
DOI: https://doi.org/10.1007/3-540-45535-3_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42225-9
Online ISBN: 978-3-540-45535-6
eBook Packages: Springer Book Archive