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.
Similar content being viewed by others
Notes
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
Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23, 769–805 (1998)
Ben-Tal, A., Nemirovski, A.: Robust optimization—methodology and applications. Math. Prog. 92, 453–480 (2002)
Bertsimas, D., Nohadani, O.: Robust optimization with simulated annealing. J. Global Optim. 48, 323–334 (2010)
Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52, 35–53 (2004)
Bertsimas, D., Nohadani, O., Teo, K.M.: Nonconvex Robust optimization for problems with constraints. Inf. J. Comput. 22, 44–58 (2010)
Bertsimas, D., Nohadani, O., Teo, K.M.: Robust optimization for unconstrained simulation-based problems. Oper. Res. 58, 161–178 (2010)
Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of Robust optimization. SIAM Rev. 53, 464–501 (2011)
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
Hansen, E.R., Walster, W.G.: Global Optimization Using Interval Analysis, 2nd edn. Marcel Dekker Inc., New York (2004)
Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer Academic Publishers, Dordrecht (1996)
Klatte, R., Kulisch, U., Wiethoff, A., Lawo, C., Rauch, M.: C-XSC - A C++ class library for extended scientific computing. Springer, Heidelberg (1993)
Lasserre, J.B.: Robust global optimization with polynomials. Math. Prog. 107, 275–293 (2006)
Lasserre, J.B.: Minmax and Robust polynomial optimization. J. Global Optim. 51, 1–10 (2011)
Messine, F., Trombettoni, G.: Reliable bounds for convex relaxation in interval global optimization codes. AIP Conference Proceedings 2070, LEGO, GOW, Leiden, 2019
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)
Moore, R.E.: Interval Analysis. Prentice-Hall Inc., Englewood Cliffs (1966)
Ninin, J., Messine, F., Hansen, P.: A reliable affine relaxation method for global optimization. 4OR-A Quaterly J. Oper. Res. 13, 247–277 (2015)
Pál, L., Csendes, T.: INTLAB implementation of an interval global optimization algorithm. Optim. Methods Software 24, 749–759 (2009)
Ratschek, H., Rokne, J.: New Computer Methods for Global Optimization. Ellis Horwood Ltd, Chichester (1988)
Rump, S.M.: INTLAB - INTerval LABoratory. In: Csendes, Tibor (ed.) Developments in Reliable Computing, pp. 77–104. Kluwer Academic Publishers, Dordrecht (1999)
Surjanovic, S., Bingham, D. www.sfu.ca/~ssurjano/optimization.html
Zhang, Y.: General robust-optimization formulation for nonlinear programming. J. Optim. Theory Appl. 132, 111–124 (2007)
Author information
Authors and Affiliations
Corresponding author
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
About this article
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
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-021-01010-5