Global optimization issues in multiparametric continuous and mixed-integer optimization problems
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
In this paper, a number of theoretical and algorithmic issues concerning the solution of parametric nonconvex programs are presented. In particular, the need for defining a suitable overestimating subproblem is discussed in detail. The multiparametric case is also addressed, and a branch and bound (B&B) algorithm for the solution of parametric nonconvex programs is proposed. 2004 Kluwer Academic Publishers.