Computational Studies of the αBB Approach

  • Christodoulos A. Floudas
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 37)


In this chapter, we discuss the algorithmic issues of the αBB global optimization approach, along with its implementation and a variety of computational studies. Section 13.1 focuses on the important issues of branching strategies and variable bound updates. Section 13.2 describes the implementation of the αBB. Finally, section 13.3 presents extensive computational studies on literature, engineering design and stability problems. The material presented in this chapter is based on the work of Adjiman et al. (1998b).


Variable Bound Convex Envelope Bilinear Term Maximum Separation Distance Global Optimization Approach 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2000

Authors and Affiliations

  • Christodoulos A. Floudas
    • 1
  1. 1.Department of Chemical EngineeringPrinceton UniversityPrincetonUSA

Personalised recommendations