Global optimization of generalized semi-infinite programs using disjunctive programming

Peter Kirst, Oliver Stein

We propose a new branch-and-bound algorithm for global minimization of generalized semi-infinite programs. It treats the inherent disjunctive structure of these problems by tailored lower bounding procedures. Our numerical results on standard test problems with three different such lower bounding procedures show the merits of our approach.