An interval branch and bound method for global Robust optimization

被引：2
|
作者：
Carrizosa, Emilio [1 ]
Messine, Frederic [2 ]
机构：
[1] Univ Seville, IMUS Inst Matemat, Seville, Spain
[2] Univ Toulouse, CNRS, LAPLACE, UMR5213,ENSEEIHT Toulouse INP, Toulouse, France
来源：
JOURNAL OF GLOBAL OPTIMIZATION | 2021年 / 80卷 / 03期
关键词：
Robust optimization; Interval arithmetic; Branch and bound;
D O I：
10.1007/s10898-021-01010-5
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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.
引用
收藏
页码：507 / 522
页数：16
相关论文
共 50 条
  • [21] BMI global optimization using parallel branch and bound method with a novel branching method
    Kawanishi, Michihiro
    Shibata, Yoshiya
    [J]. 2007 AMERICAN CONTROL CONFERENCE, VOLS 1-13, 2007, : 1924 - +
  • [22] Multisection in interval branch-and-bound methods for global optimization -: I.: Theoretical results
    Csallner, AE
    Csendes, T
    Markót, MC
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2000, 16 (04) : 371 - 392
  • [23] Multisection in Interval Branch-and-Bound Methods for Global Optimization II. Numerical Tests
    Mihály Csaba Markót
    Tibor Csendes
    András Erik Csallner
    [J]. Journal of Global Optimization, 2000, 16 (3) : 219 - 228
  • [24] Multisection in Interval Branch-and-Bound Methods for Global Optimization – I. Theoretical Results
    András Erik Csallner
    Tibor Csendes
    Mihály Csaba markót
    [J]. Journal of Global Optimization, 2000, 16 : 371 - 392
  • [25] Multisection in interval branch-and-bound methods for global optimization II.: Numerical tests
    Markót, MC
    Csendes, T
    Csallner, AE
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2000, 16 (03) : 219 - 228
  • [26] On parallel Branch and Bound frameworks for Global Optimization
    Herrera, Juan F. R.
    Salmeron, Jose M. G.
    Hendrix, Eligius M. T.
    Asenjo, Rafael
    Casado, Leocadio G.
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2017, 69 (03) : 547 - 560
  • [27] AN ELLIPSOIDAL BRANCH AND BOUND ALGORITHM FOR GLOBAL OPTIMIZATION
    Hager, William W.
    Phan, Dzung T.
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2009, 20 (02) : 740 - 758
  • [28] Branch and bound with simplicial partitions for global optimization
    Zilinskas, J.
    [J]. MATHEMATICAL MODELLING AND ANALYSIS, 2008, 13 (01) : 145 - 159
  • [29] On parallel Branch and Bound frameworks for Global Optimization
    Juan F. R. Herrera
    José M. G. Salmerón
    Eligius M. T. Hendrix
    Rafael Asenjo
    Leocadio G. Casado
    [J]. Journal of Global Optimization, 2017, 69 : 547 - 560
  • [30] An interval algorithm for bound constrained global optimization
    Wolfe, MA
    [J]. OPTIMIZATION METHODS & SOFTWARE, 1995, 6 (02): : 145 - 159
12345