Geometric branch-and-bound methods for constrained global optimization problems
- First online:
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.