On interval branch-and-bound for additively separable functions with common variables
- 347 Downloads
Interval branch-and-bound (B&B) algorithms are powerful methods which look for guaranteed solutions of global optimisation problems. The computational effort needed to reach this aim, increases exponentially with the problem dimension in the worst case. For separable functions this effort is less, as lower dimensional sub-problems can be solved individually. The question is how to design specific methods for cases where the objective function can be considered separable, but common variables occur in the sub-problems. This paper is devoted to establish the bases of B&B algorithms for separable problems. New B&B rules are presented based on derived properties to compute bounds. A numerical illustration is elaborated with a test-bed of problems mostly generated by combining traditional box constrained global optimisation problems, to show the potential of using the derived theoretical basis.
KeywordsBranch-and-bound Interval arithmetic Separable functions
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.
- 2.C-XSC: University Wuppertal. http://www.math.uni-wuppertal.de/~xsc.
- 4.Hansen E.R., Walster G.W.: Global Optimization Using Interval Analysis. Marcel Dekker, New York (2004)Google Scholar
- 8.Messine F., Lagouanelle J.-L.: Enclosure methods for multivariate differentiable functions and application to global optimization. J. Univers. Comput. Sci. 4(6), 589–603 (1998)Google Scholar
- 10.Moore R.E.: Interval Analysis. Prentice-Hall, New Jersey (1966)Google Scholar
- 14.Ratschek H., Rokne J.: Computer Methods for the Range of Functions. Ellis Horwood, Chichester (1984)Google Scholar
- 15.Ratschek H., Rokne J.: New Computer Methods for Global Optimization. Ellis Horwood, Chichester (1988)Google Scholar