Outer Cut Methods in Global Optimization

A brief report is presented on recent developments in outer cut methods for solving certain classes of constrained global optimization problems. First, two theorems are stated each of which is helpful to assert convergence of a basic concept. Nonlinear cuts and unbounded feasible sets are admitted. A broad class of new cutting plane methods can be deduced. Moreover, a practically useful constraint dropping strategy is given and, finally, some questions of numerical implementations are discussed including the computation of new vertices generated by a cut and the identification of redundant constraints.