Skip to main content
SpringerLink
Log in

Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we consider the generation of disjunctive cuts for 0-1 mixed-integer programs by conducting a partial exploration of the branch-and-bound tree using quick Lagrangian primal and dual updates. We analyze alternative cut generation strategies based on formulating different disjunctions and adopting various choices of normalization techniques, and indicate how these inequalities can also be generated using a projection from a related high-order lifted formulation obtained via the Reformulation-Linearization Technique of Sherali and Adams. We conclude by presenting a brief computational study that motivates the potential benefits of this procedure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Applegate, D., Bixby, R.E., Chvátal, V., Cook, W.: Finding cuts in the TSP. Technical Report 09-05, DIMACS (1995)

  2. Balas E.: Disjunctive programming. Ann. Discrete Math. 5, 3–31 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  3. Balas E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89(1–3), 3–44 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Balas E., Bonami P.: Generating lift-and-project cuts from the LP simplex tableau: Open source implementation and testing of new variants. Math. Program. Comput. 1(2–3), 169–199 (2009)

    MathSciNet  Google Scholar 

  5. Barahona F., Anbil R.: The volume algorithm: Producing primal solutions with a subgradient method. Math. Program. 87, 385–399 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Camerini P.M., Fratta L., Maffioli F.: On improving relaxation methods by modified gradient techniques. Math. Program. Study 3, 26–34 (1975)

    MathSciNet  Google Scholar 

  7. Fisher M.: The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 27(1), 1–18 (1981)

    Article  MATH  Google Scholar 

  8. Held M., Wolfe P., Crowder H.: Validation of subgradient optimization. Math. Program. 6, 62–88 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kiwiel K.C.: Proximity control in bundle methods for convex nondifferentiable minimization. Math. Program. 46(1–3), 105–122 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  10. Larsson T., Patriksson M., Strömberg A.-B.: Ergodic, primal convergence in dual subgradient schemes for convex programming. Math. Program. 86, 283–312 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  11. Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization, second edition. Wiley, New York (1999)

    MATH  Google Scholar 

  12. Nesterov Y.: Smooth minimization of non-smooth functions. Mathematical Programming 103, 127–152 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Polyak B.T.: A general method of solving extremum problems. Sov. Math. Doklady 8, 593–597 (1967)

    MATH  Google Scholar 

  14. Polyak B.T.: Minimization of unsmooth functionals. USSR Comput. Mathematics and Mathematical Physics 9, 14–29 (1969)

    Article  Google Scholar 

  15. Shapiro J.F.: A survey of Lagrangean techniques for discrete optimization. Ann. Discrete Math. 5, 113–138 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  16. Sherali H.D., Adams W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3), 411–430 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  17. Sherali H.D., Adams W.P.: A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. 52(1), 83–106 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  18. Sherali H.D., Adams W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishers, Dordrecht (1999)

    MATH  Google Scholar 

  19. Sherali H.D., Choi G.: Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs. Oper. Res. Lett. 19(3), 105–113 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  20. Sherali H.D., Choi G., Tuncbilek C.H.: A variable target value method for nondifferentiable optimization. Oper. Res. Lett. 26(1), 1–8 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  21. Sherali H.D., Lim C.: On embedding the Volume Algorithm in a variable target value method for solving Lagrangian relaxations of linear programs. Oper. Res. Lett. 32(5), 455–462 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  22. Sherali H.D., Lim C.: Enhancing Lagrangian dual optimization for linear programs by obviating nondifferentiability. INFORMS J. Comput. 19(1), 3–13 (2007)

    Article  MathSciNet  Google Scholar 

  23. Sherali H.D., Shetty C.M.: On the generation of deep disjunctive cutting planes. Nav. Res. Logist. Quart. 27(3), 453–475 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  24. Sherali H.D., Shetty C.M.: Optimization with Disjunctive Constraints. Number 181 in Series in Economics and Mathematical Systems. Springer, Berlin (1980)

    Google Scholar 

  25. Sherali H.D., Ulular O.: A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems. Appl. Math. Optim. 20, 193–221 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  26. Shor N.Z.: Minimization Methods for Nondifferentiable Functions. Springer, Berlin (1985)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Grado Department of Industrial and Systems Engineering (0118), Virginia Polytechnic Institute and State University, Blacksburg, VA, 24061, USA

    Hanif D. Sherali

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611, USA

    J. Cole Smith

Authors
  1. Hanif D. Sherali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Cole Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Cole Smith.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sherali, H.D., Smith, J.C. Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs. Optim Lett 6, 127–139 (2012). https://doi.org/10.1007/s11590-010-0255-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-010-0255-1

Keywords

Search

Navigation