On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems

Authors:
  • FAFaiz A. Al-Khayyal
    Faiz A. Al-Khayyal
  • HSHanif D. Sherali
    Hanif D. Sherali

Abstract
Global optimization algorithms are typically terminated with an $\epsilon$-approximate solution after a finite number of iterations. This paper shows how existing infinitely convergent branch-and-bound algorithms can be augmented to guarantee finite termination with an exact global solution for problems having extreme point solutions.

This publication has 18 references indexed in Scilit: