On convergence of the simplicial branch-and-bound algorithm based on ω-subdivisions

The problem of minimizing a concave function over a polytope is considered. The simplicial branch-and-bound approach is presented and theoretical studies about the convergence of these algorithms are carried on. In particular, the convergence of the algorithm based on so-called omega -subdivisions is proved, which had been an open question for a long time.