Computational Studies of the αBB Approach
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).
KeywordsVariable Bound Convex Envelope Bilinear Term Maximum Separation Distance Global Optimization Approach
Unable to display preview. Download preview PDF.