Global optimization of generalized semi-infinite programs using disjunctive programming
We propose a new branch-and-bound algorithm for global minimization of box-constrained generalized semi-infinite programs. It treats the inherent disjunctive structure of these problems by tailored lower bounding procedures. Three different possibilities are examined. The first one relies on standard lower bounding procedures from conjunctive global optimization as described in Kirst et al. (J Global Optim 69: 283–307, 2017). The second and the third alternative are based on linearization techniques by which we derive linear disjunctive relaxations of the considered sub-problems. Solving these by either mixed-integer linear reformulations or, alternatively, by disjunctive linear programming techniques yields two additional possibilities. Our numerical results on standard test problems with these three lower bounding procedures show the merits of our approach.
KeywordsGeneralized semi-infinite optimization Disjunctive optimization Global optimization Branch-and-bound
We thank two anonymous referees for their precise and substantial remarks, which helped to significantly improve the paper.
- 8.Lemonidis, P.: Global Optimization Algorithms for Semi-infinite and Generalized Semi-infinite Programs. Ph.D. Thesis. Massachusetts Institute of Technology (2008)Google Scholar
- 13.Schwientek, J., Seidel, T., Küfer, K.-H.: A Transformation-based Discretization Method for Solving General Semi-infinite Optimization Problems. Optimization Online Preprint-ID 2017-12-6380 (2017)Google Scholar
- 38.Makhorin, A.: GNU Linear Proramming Kit. Department for Applied Informatics, Moscow Aviation Institute, Moscow (2010)Google Scholar