Spatial branch-and-bound is a divide-and-conquer technique used to find the deterministic solution of global optimization problems.1 It is a type of branch-and-bound method, which solves for the set of parameters that globally optimize the objective function, whether that be finding the minimum or maximum value of or , respectively, where x exists over a set of candidate solutions in the feasible region of the problem.

Last modified

• 11/29/2018

Creator

• Ellen Zhuang

DOI

• https://doi.org/10.21985/N22B2B

Keyword

• Bound
• Spatial Branch

Rights statement

• In Copyright