A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization (Q1067978): Difference between revisions

Based on a review of existing algorithms, a general branch-and-bound concept in global optimization is presented. A sufficient and necessary convergence condition is established, and a broad class of realizations is derived that include existing and several new approaches for concave minimization problems.