Skip to main content
Log in

An interval branch and bound method for global Robust optimization

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

Abstract

In this paper, we design a Branch and Bound algorithm based on interval arithmetic to address nonconvex robust optimization problems. This algorithm provides the exact global solution of such difficult problems arising in many real life applications. A code was developed in MatLab and was used to solve some robust nonconvex problems with few variables. This first numerical study shows the interest of this approach providing the global solution of such difficult robust nonconvex optimization problems.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Notes

  1. An interval function F is said isotone if for any couple \((X',X)\) such that \(X'\subseteq X\), we have \(F(X')\subseteq F(X)\).

References

  1. Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23, 769–805 (1998)

    Article  MathSciNet  Google Scholar 

  2. Ben-Tal, A., Nemirovski, A.: Robust optimization—methodology and applications. Math. Prog. 92, 453–480 (2002)

    Article  MathSciNet  Google Scholar 

  3. Bertsimas, D., Nohadani, O.: Robust optimization with simulated annealing. J. Global Optim. 48, 323–334 (2010)

    Article  MathSciNet  Google Scholar 

  4. Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52, 35–53 (2004)

    Article  MathSciNet  Google Scholar 

  5. Bertsimas, D., Nohadani, O., Teo, K.M.: Nonconvex Robust optimization for problems with constraints. Inf. J. Comput. 22, 44–58 (2010)

    Article  MathSciNet  Google Scholar 

  6. Bertsimas, D., Nohadani, O., Teo, K.M.: Robust optimization for unconstrained simulation-based problems. Oper. Res. 58, 161–178 (2010)

    Article  MathSciNet  Google Scholar 

  7. Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of Robust optimization. SIAM Rev. 53, 464–501 (2011)

    Article  MathSciNet  Google Scholar 

  8. Gabrel, V., Murat, C., Thiele, A.: Recent Advances in Robust Optimization: An Overview. Technical report, 2013. Available as www.optimization-online.org/DB_FILE/2012/07/3537.pdf

  9. Hansen, E.R., Walster, W.G.: Global Optimization Using Interval Analysis, 2nd edn. Marcel Dekker Inc., New York (2004)

    MATH  Google Scholar 

  10. Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer Academic Publishers, Dordrecht (1996)

    Book  Google Scholar 

  11. Klatte, R., Kulisch, U., Wiethoff, A., Lawo, C., Rauch, M.: C-XSC - A C++ class library for extended scientific computing. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  12. Lasserre, J.B.: Robust global optimization with polynomials. Math. Prog. 107, 275–293 (2006)

    Article  MathSciNet  Google Scholar 

  13. Lasserre, J.B.: Minmax and Robust polynomial optimization. J. Global Optim. 51, 1–10 (2011)

    Article  MathSciNet  Google Scholar 

  14. Messine, F., Trombettoni, G.: Reliable bounds for convex relaxation in interval global optimization codes. AIP Conference Proceedings 2070, LEGO, GOW, Leiden, 2019

  15. Messine, F.: A deterministic global optimization algorithm for design problems. In: Audet, C., Hansen, P., Savard, G. (eds.) Essays and Surveys in Global Optimization, pp. 267–294. Springer, New York (2005)

    Chapter  Google Scholar 

  16. Moore, R.E.: Interval Analysis. Prentice-Hall Inc., Englewood Cliffs (1966)

    MATH  Google Scholar 

  17. Ninin, J., Messine, F., Hansen, P.: A reliable affine relaxation method for global optimization. 4OR-A Quaterly J. Oper. Res. 13, 247–277 (2015)

    Article  MathSciNet  Google Scholar 

  18. Pál, L., Csendes, T.: INTLAB implementation of an interval global optimization algorithm. Optim. Methods Software 24, 749–759 (2009)

    Article  MathSciNet  Google Scholar 

  19. Ratschek, H., Rokne, J.: New Computer Methods for Global Optimization. Ellis Horwood Ltd, Chichester (1988)

    MATH  Google Scholar 

  20. Rump, S.M.: INTLAB - INTerval LABoratory. In: Csendes, Tibor (ed.) Developments in Reliable Computing, pp. 77–104. Kluwer Academic Publishers, Dordrecht (1999)

    Chapter  Google Scholar 

  21. Surjanovic, S., Bingham, D. www.sfu.ca/~ssurjano/optimization.html

  22. Zhang, Y.: General robust-optimization formulation for nonlinear programming. J. Optim. Theory Appl. 132, 111–124 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frédéric Messine.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

The work of E. Carrizosa has been funded in part by Projects MTM2015-65915-R (Ministerio de Ciencia e Innovación, Spain), P11-FQM-7603, FQM329 (Junta de Andalucía), all with EU ERDF funds.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Carrizosa, E., Messine, F. An interval branch and bound method for global Robust optimization. J Glob Optim 80, 507–522 (2021). https://doi.org/10.1007/s10898-021-01010-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-021-01010-5

Keywords

Navigation