Ebook: Handbook of Test Problems in Local and Global Optimization

Significant research activities have taken place in the areas of local and global optimization in the last two decades. Many new theoretical, computational, algorithmic, and software contributions have resulted. It has been realized that despite these numerous contributions, there does not exist a systematic forum for thorough experimental computational testing and· evaluation of the proposed optimization algorithms and their implementations. Well-designed nonconvex optimization test problems are of major impor­ tance for academic and industrial researchers interested in algorithmic and software development. It is remarkable that eventhough nonconvex models dominate all the important application areas in engineering and applied sci­ ences, there is only a limited dass of reported representative test problems. This book reflects our long term efforts in designing a benchmark database and it is motivated primarily from the need for nonconvex optimization test problems. The present collection of benchmarks indudes test problems from literature studies and a large dass of applications that arise in several branches of engineering and applied science.

---

The principal objective of this book is to present a collection of challenging test problems arising in literature studies and a wide spectrum of applications. These applications include: pooling/blending operations, heat exchanger network synthesis, phase and chemical reactor network synthesis, parameter estimation and data reconciliation, clusters of atoms and molecules, pump network synthesis, trim loss minimization, homogeneous azeotropic separation, dynamic optimization and optimal control problems.
Audience: This book will be of value to academic and industrial researchers interested in algorithmic and software development of well-designed nonconvex optimization test problems.

---

The principal objective of this book is to present a collection of challenging test problems arising in literature studies and a wide spectrum of applications. These applications include: pooling/blending operations, heat exchanger network synthesis, phase and chemical reactor network synthesis, parameter estimation and data reconciliation, clusters of atoms and molecules, pump network synthesis, trim loss minimization, homogeneous azeotropic separation, dynamic optimization and optimal control problems.
Audience: This book will be of value to academic and industrial researchers interested in algorithmic and software development of well-designed nonconvex optimization test problems.
Content:
Front Matter....Pages i-xv
Introduction....Pages 1-3
Quadratic Programming Problems....Pages 5-19
Quadratically Constrained Problems....Pages 21-26
Univariate Polynomial Problems....Pages 27-31
Bilinear problems....Pages 33-57
Biconvex and Difference of Convex Functions (D.C.) Problems....Pages 59-84
Generalized Geometric Programming Problems....Pages 85-105
Twice Continuously Differentiable NLP Problems....Pages 107-204
Bilevel Programming Problems....Pages 205-231
Complementarity Problems....Pages 233-249
Semidefinite Programming Problems....Pages 251-261
Mixed-Integer Nonlinear Programming Problems (MINLPs)....Pages 263-302
Combinatorial Optimization Problems....Pages 303-324
Nonlinear Systems of Equations....Pages 325-349
Dynamic Optimization Problems....Pages 351-412
Back Matter....Pages 413-441

---

The principal objective of this book is to present a collection of challenging test problems arising in literature studies and a wide spectrum of applications. These applications include: pooling/blending operations, heat exchanger network synthesis, phase and chemical reactor network synthesis, parameter estimation and data reconciliation, clusters of atoms and molecules, pump network synthesis, trim loss minimization, homogeneous azeotropic separation, dynamic optimization and optimal control problems.
Audience: This book will be of value to academic and industrial researchers interested in algorithmic and software development of well-designed nonconvex optimization test problems.
Content:
Front Matter....Pages i-xv
Introduction....Pages 1-3
Quadratic Programming Problems....Pages 5-19
Quadratically Constrained Problems....Pages 21-26
Univariate Polynomial Problems....Pages 27-31
Bilinear problems....Pages 33-57
Biconvex and Difference of Convex Functions (D.C.) Problems....Pages 59-84
Generalized Geometric Programming Problems....Pages 85-105
Twice Continuously Differentiable NLP Problems....Pages 107-204
Bilevel Programming Problems....Pages 205-231
Complementarity Problems....Pages 233-249
Semidefinite Programming Problems....Pages 251-261
Mixed-Integer Nonlinear Programming Problems (MINLPs)....Pages 263-302
Combinatorial Optimization Problems....Pages 303-324
Nonlinear Systems of Equations....Pages 325-349
Dynamic Optimization Problems....Pages 351-412
Back Matter....Pages 413-441
....