Testing branch-and-bound methods for global optimization

Kaj Madsen (km@imm.dtu.dk), and Julius Zilinskas

For a copy of this paper, either Abstract:

This report presents results of some experiments with two codes implementing attraction based branch-and-bound global optimization methods: A non-deterministic method using real arithmetic, and a deterministic interval arithmetic method. The domain of the optimization is a compact right parallelpiped in Rn, parallel to the coordinate axes.
Traditional mathematical test functions as well as two practical problems were used for the testing.

IMM technical report 05/2000

Last update 26-5-2000 by fkc
IMM HomePage