Handbook of test problems in local and global optimization (Q1304172)

The book presents a collection of test problems for mathematical optimization, where the following categories are covered: Quadratic programming problems (10), quadratically constrained problems (4), univariate polynomial problems (9), bilinear problems (8), biconvex and difference of convex function problems (14), generalized geometric programming (16), twice continuously differentiable NLPs (46), bilevel programming problems (19), complementary problems (12), semidefinite programming problems (1), mixed-integer nonlinear problems (12), combinatorial optimization problems (10), nonlinear systems of equations (18), dynamic optimization problems (25). The number of test examples that can be downloaded from the home page of the first author, is shown in brackets. The codes are available either in the GAMS or in case of dynamic optimization, the MINOPT format, a modeling language developed at the same institute. Moreover, the book contains numerous links to existing test problem collections related to the topics. The purpose of the book is to present a large collection of mathematical optimization problems where most of them model a practical application, in particular from computational chemistry. The mathematical structure of the optimization problem, and a brief outline of the underlying model type are presented, also a review on available solution methods. The test problem collection might be useful for people developing optimization software, and for those who would like to get a review about various classes of mathematical optimization problems that can be solved in practice. Moreover, it is certainly valuable also for chemical engineers who want to become familiar with mathematical modeling. Main emphasis is to find a global solution in case of a nonconvex NLP, not a local one. Links or references to some standard test problems collections and test problem generators are missing, e.g., to the widely used CUTE test problem collection.