A reduced space branch and bound algorithm for global optimization Academic Article

abstract

• A general class of branch and bound algorithms for solving a wide class of nonlinear programs with branching only in a subset of the problem variables is presented. By reducing the dimension of the search space, this technique may dramatically reduce the number of iterations and time required for convergence to tolerance while retaining proven exact convergence in the infinite limit. This presentation includes specifications of the class of nonlinear programs, a statement of a class of branch and bound algorithms, a convergence proof, and motivating examples with results.

authors

• Pistikopoulos, Stratos

published proceedings

• JOURNAL OF GLOBAL OPTIMIZATION

author list (cited authors)

• Epperly, T., & Pistikopoulos, E. N.

citation count

• 46

publication date

• October 1997

publisher

• Springer Nature  Publisher

keywords

• Branch And Bound
• Convex Envelope
• Global Optimization
• Reduced Space

Digital Object Identifier (DOI)

• 10.1023/A:1008212418949

start page

• 287

end page

• 311

volume

• 11

issue

• 3

URL

• http://dx.doi.org/10.1023/a:1008212418949