GAMS/BARON: A Tutorial and Empirical Performance Analysis
The purpose of this chapter is threefold. First, to provide modelers, students, and practitioners with easily accessible models and reproducible computational results. Second, to demonstrate that the algorithms proposed in this book can be used to solve global optimization models with minimal user intervention. Third, to provide a tutorial for the recently developed version of BARON integrated with the GAMS modeling environment. To achieve these goals, we provide in GAMS format many of the models used throughout the book, including the molecular design problem of Chapter 8, the pooling problems of Chapter 9, as well as multiplicative programs, benchmark factorable problems from the engineering and optimization literature, just-in-time flowshop design problems, and the Gupta-Ravindran collection of MINLPs of Chapter 10. Finally, we demonstrate that the techniques proposed in this book can be easily used to find all feasible solutions to systems of nonlinear equations as well as hard combinatorial optimization problems with no user intervention.
To ensure easy access and reproducibility of the results presented in this chapter, all models solved here have been placed on the book Web site and contributed to appropriate model collection libraries on the Internet (globallib and minlplib).
KeywordsLocal Search Feasible Solution Local Solver GAMS Model Option File
Unable to display preview. Download preview PDF.