Geometric branch-and-bound methods for constrained global optimization problems
- 641 Downloads
Geometric branch-and-bound methods are popular solution algorithms in deterministic global optimization to solve problems in small dimensions. The aim of this paper is to formulate a geometric branch-and-bound method for constrained global optimization problems which allows the use of arbitrary bounding operations. In particular, our main goal is to prove the convergence of the suggested method using the concept of the rate of convergence in geometric branch-and-bound methods as introduced in some recent publications. Furthermore, some efficient further discarding tests using necessary conditions for optimality are derived and illustrated numerically on an obnoxious facility location problem.
KeywordsGlobal optimization Geometric branch-and-bound Approximation algorithms Continuous location
The author would like to thank Anita Schöbel for fruitful suggestions for improving the paper. Furthermore, the author gratefully acknowledges the anonymous referees for their helpful comments.
This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
- Bazaraa M.S., Sherali H.D., Shetty C.M.: Nonlinear Programming: Theory and Algorithms. 2nd edn. Wiley-Interscience, New York (1993)Google Scholar
- Floudas C.A.: Deterministic Global Optimization: Theory, Methods and Applications. 1st edn. Springer, New York (1999)Google Scholar
- Hansen E.: Global Optimization Using Interval Analysis. 1st edn. Marcel Dekker, New York (1992)Google Scholar
- Horst R., Pardalos P.M., Thoai N.V.: Introduction to Global Optimization. 2nd edn. Springer, Berlin (2000)Google Scholar
- Neumaier A.: Interval Methods for Systems of Equations. 1st edn. Cambridge University Press, New York (1990)Google Scholar
- Ratschek H., Rokne J.: New Computer Methods for Global Optimization. 1st edn. Ellis Horwood, Chichester, England (1988)Google Scholar
- Scholz, D.: Theoretical rate of convergence for interval inclusion functions. J. Glob. Optim. (2011). doi: 10.1007/s10898-011-9735-9