Mathematical Programming

, Volume 47, Issue 1–3, pp 155–174 | Cite as

Chvátal closures for mixed integer programming problems

  • W. Cook
  • R. Kannan
  • A. Schrijver
Article

Abstract

Chvátal introduced the idea of viewing cutting planes as a system for proving that every integral solution of a given set of linear inequalities satisfies another given linear inequality. This viewpoint has proven to be very useful in many studies of combinatorial and integer programming problems. The basic ingredient in these cutting-plane proofs is that for a polyhedronP and integral vectorw, if max(wx|x ∈ P, wx integer} =t, thenwx ⩽ t is valid for all integral vectors inP. We consider the variant of this step where the requirement thatwx be integer may be replaced by the requirement that\(\bar wx\) be integer for some other integral vector\(\bar w\). The cutting-plane proofs thus obtained may be seen either as an abstraction of Gomory's mixed integer cutting-plane technique or as a proof version of a simple class of the disjunctive cutting planes studied by Balas and Jeroslow. Our main result is that for a given polyhedronP, the set of vectors that satisfy every cutting plane forP with respect to a specified subset of integer variables is again a polyhedron. This allows us to obtain a finite recursive procedure for generating the mixed integer hull of a polyhedron, analogous to the process of repeatedly taking Chvátal closures in the integer programming case. These results are illustrated with a number of examples from combinatorial optimization. Our work can be seen as a continuation of that of Nemhauser and Wolsey on mixed integer cutting planes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E. Balas, “Disjunctive programming,”Annals of Discrete Mathematics 5 (1979) 3–51.Google Scholar
  2. [2]
    F. Barahona, M. Grötschel and A. Mahjoub, “Facets of the bipartite subgraph polytope,”Mathematics of Operations Research 10 (1985) 340–358.Google Scholar
  3. [3]
    I. Bárány, T. van Roy and L.A. Wolsey, “Uncapacitated lot-sizing: the convex hull of solutions,”Mathematical Programming Study 22 (1984) 32–43.Google Scholar
  4. [4]
    J.J. Bartholdi, J.B. Orlin and H.D. Ratliff, “Cyclic scheduling via integer programs with circular ones,”Operations Research 28 (1980) 1074–1085.Google Scholar
  5. [5]
    C.E. Blair and R.G. Jeroslow, “Constructive characterizations of the value-function of a mixedinteger program I,”Discrete Applied Mathematics 9 (1984) 217–308.Google Scholar
  6. [6]
    C.E. Blair and R.G. Jeroslow, “Constructive characterizations of the value-function of a mixedinteger program II,”Discrete Applied Mathematics 10 (1985) 211–226.Google Scholar
  7. [7]
    D.C. Cho, E.L. Johnson, M. Padberg and M.R. Rao, “On the uncapacitated plant location problem I: valid inequalities and facets,”Mathematics of Operations Research 8 (1983) 579–589.Google Scholar
  8. [8]
    V. Chvátal, “Edmonds polytopes and a hierarchy of combinatorial problems,”Discrete mathematics 4 (1973) 305–337.Google Scholar
  9. [9]
    V. Chvátal, “Edmonds polytopes and weakly hamiltonian graphs,”Mathematical Programming 5 (1973) 29–40.Google Scholar
  10. [10]
    V. Chvátal, “Cutting-plane proofs and the stability number of a graph,” Report Number 84326-OR, Institut für Ökonometrie und Operations Research, Universität Bonn (Bonn, 1984).Google Scholar
  11. [11]
    V. Chvátal, “Cutting planes in combinatorics,”European Journal of Combinatorics 6 (1985) 217–226.Google Scholar
  12. [12]
    G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, “Solution of a large-scale traveling salesman problem,”Operations Research 2 (1954) 393–410.Google Scholar
  13. [13]
    R.E. Gomory, “An algorithm for mixed integer programming,” RM-2597, The RAND Corporation (1960).Google Scholar
  14. [14]
    R.E. Gomory, “An algorithm for integer solutions to linear programs,” in: R.L. Graves and P. Wolfe, eds.,Recent Advances in Mathemaical Programming (McGraw-Hill, New York, 1963) pp. 269–302.Google Scholar
  15. [15]
    M. Grötschel and M.W. Padberg, “On the symmetric travelling salesman problem I: inequalities,”Mathematical Programming 16 (1979) 265–280.Google Scholar
  16. [16]
    M. Grötschel and W.R. Pulleyblank, “Clique tree inequalities and the symmetric travelling salesman problem,”Mathematics of Operations Research 11 (1986) 537–569.Google Scholar
  17. [17]
    G.H. Hardy and E.M. Wright,An Introduction to the Theory of Numbers (Oxford University Press, Oxford, 1979).Google Scholar
  18. [18]
    R.G. Jeroslow, “Cutting-plane theory: disjunctive methods,”Annals of Discrete Mathematics 1 (1977) 293–330.Google Scholar
  19. [19]
    J.M.Y. Leong and T.L. Magnanti, “Valid inequalities and facets of the capacitated plant location problem,” Working Paper OR-149-86, MIT (Cambridge, MA, 1986).Google Scholar
  20. [20]
    L. Lovász,An Algorithmic Theory of Numbers, Graphs and Convexity. CMBS-NSF Regional Conference Series in Applied Mathematics, Vol. 50 (SIAM, Philadelphia, PA, 1986).Google Scholar
  21. [21]
    G.L. Nemhauser and L.A. Wolsey, “A recursive procedure for generating all 0-1 mixed integer cuts,” CORE Discussion Paper 8439, Université Catholique de Louvain (Louvain-la-Neuve, 1984).Google Scholar
  22. [22]
    M.W. Padberg, T.J. van Roy and L.A. Wolsey, “Valid linear inequalities for fixed charge problems,”Operations Research 33 (1985) 842–861.Google Scholar
  23. [23]
    A. Schrijver, “On cutting planes,”Annals of Discrete Mathematics 9 (1980) 291–296.Google Scholar
  24. [24]
    A. Schrijver,Theory of Linear and Integer Programming (Wiley, Chichester, 1986).Google Scholar

Copyright information

© The Mathematical Programming Society, Inc. 1990

Authors and Affiliations

  • W. Cook
    • 1
  • R. Kannan
    • 2
  • A. Schrijver
    • 3
  1. 1.Institut für Ökonometrie und Operations ResearchUniversität BonnBonnFR Germany
  2. 2.Department of Computer ScienceCarnegie-Mellon UniversityPittsburghUSA
  3. 3.Mathematical CentreAmsterdamThe Netherlands

Personalised recommendations