Skip to main content

Advertisement

SpringerLink
Log in

Bound reduction using pairs of linear inequalities

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We describe a procedure to reduce variable bounds in mixed integer nonlinear programming (MINLP) as well as mixed integer linear programming (MILP) problems. The procedure works by combining pairs of inequalities of a linear programming (LP) relaxation of the problem. This bound reduction procedure extends the feasibility based bound reduction technique on linear functions, used in MINLP and MILP. However, it can also be seen as a special case of optimality based bound reduction, a method to infer variable bounds from an LP relaxation of the problem. For an LP relaxation with m constraints and n variables, there are O(m 2) pairs of constraints, and a naïve implementation of our bound reduction scheme has complexity O(n 3) for each pair. Therefore, its overall complexity O(m 2 n 3) can be prohibitive for relatively large problems. We have developed a more efficient procedure that has complexity O(m 2 n 2), and embedded it in two Open-Source solvers: one for MINLP and one for MILP. We provide computational results which substantiate the usefulness of this bound reduction technique for several instances.

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. Abhishek K., Leyffer S., Linderoth J.: FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs. INFORMS J. Comput. 22(4), 555–567 (2010)

    Article  Google Scholar 

  2. Andersen E.D., Andersen K.D.: Presolving in linear programming. Math. Program. 71, 221–245 (1995)

    Google Scholar 

  3. Belotti, P.: couenne: a user’s manual. Technical report, Lehigh University (2009)

  4. Belotti P., Cafieri S., Lee J., Liberti L.: Feasibility-based bounds tightening via fixed points. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications, volume 6508 of Lecture Notes in Computer Science, pp. 65–76. Springer, Berlin (2010)

    Google Scholar 

  5. Belotti P., Lee J., Liberti L., Margot F., Wächter A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4-5), 597–634 (2009)

    Article  Google Scholar 

  6. Bonami P., Biegler L., Conn A., Cornuéjols G., Grossmann I., Laird C., Lee J., Lodi A., Margot F., Sawaya N., Wächter A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5, 186–204 (2008)

    Article  Google Scholar 

  7. Caprara A., Locatelli M.: Global optimization problems and domain reduction strategies. Math. Program. 125, 123–137 (2010)

    Article  Google Scholar 

  8. CBC-2.1. Available from https://projects.coin-or.org/cbc

  9. Davis E.: Constraint propagation with interval labels. Artif. Intell. 32(3), 281–331 (1987)

    Article  Google Scholar 

  10. Eclipse public license version 1.0. http://www.eclipse.org/legal/epl-v10.html

  11. Forrest, J.: CBC, 2004. Available from http://www.coin-or.org/Cbc

  12. Forrest, J.: CLP: COIN-OR linear program solver. http://www.coin-or.org/Clp (2006)

  13. Hansen E.: Global Optimization Using Interval Analysis. Marcel Dekker Inc., New York (1992)

    Google Scholar 

  14. Land A.H., Doig A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497–520 (1960)

    Article  Google Scholar 

  15. Liberti L.: Reformulations in mathematical programming: definitions and systematics. RAIRO-RO 43(1), 55–85 (2009)

    Article  Google Scholar 

  16. Lin Y., Schrage L.: The global solver in the LINDO API. Optim. Methods and Softw. 24(4), 657–668 (2009)

    Article  Google Scholar 

  17. Lougee-Heimer, R.: Cut generation library. http://projects.coin-or.org/Cgl (2006)

  18. McCormick G.P.: Computability of global solutions to factorable nonconvex programs: Part I—Convex underestimating problems. Math. Program. 10, 146–175 (1976)

    Article  Google Scholar 

  19. Messine F.: Deterministic global optimization using interval constraint propagation techniques. RAIRO-RO 38(4), 277–294 (2004)

    Article  Google Scholar 

  20. Qualizza, A., Belotti, P., Margot, F.: Linear programming relaxations of quadratically constrained quadratic programs. In: IMA Volume Series in Mathematics and its Applications, vol. 154, pp. 407–426. Springer, Berlin (2012)

  21. Quesada I., Grossmann I.E.: Global optimization of bilinear process networks and multicomponent flows. Comput. Chem. Eng. 19(12), 1219–1242 (1995)

    Article  Google Scholar 

  22. Ratschek H., Rokne J.: Interval methods. In: Horst, R., Pardalos, P.M. (eds) Handbook of Global Optimization, vol. 1, pp. 751–828. Kluwer, Dordrecht (1995)

    Google Scholar 

  23. Ryoo H.S., Sahinidis N.V.: A branch-and-reduce approach to global optimization. J. Global Optim. 8(2), 107–138 (1996)

    Article  Google Scholar 

  24. Sahinidis N.V.: BARON: a general purpose global optimization software package. J. Global Optim. 8, 201–205 (1996)

    Article  Google Scholar 

  25. Savelsbergh M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6(4), 445–454 (1994)

    Article  Google Scholar 

  26. Smith E.M.B., Pantelides C.C.: A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 23, 457–478 (1999)

    Article  Google Scholar 

  27. Tawarmalani M., Sahinidis N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99(3), 563–591 (2004)

    Article  Google Scholar 

  28. Wächter A., Biegler L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25–57 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Clemson University, Clemson, SC, 29634, USA

    Pietro Belotti

Authors
  1. Pietro Belotti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pietro Belotti.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Belotti, P. Bound reduction using pairs of linear inequalities. J Glob Optim 56, 787–819 (2013). https://doi.org/10.1007/s10898-012-9848-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-012-9848-9

Keywords

Search

Navigation