An outer-approximation algorithm for the solution of multiparametric MINLP problems
Academic Article
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
Process synthesis problems involving uncertainty can be mathematically represented as multiparametric mixed integer nonlinear programming-(mp-MINLP) models. In this paper, we present an outer-approximation algorithm for the solution of such mp-MINLPs, described by convex process models, linear in the vectors of binary variables and uncertain parameters. The algorithm follows decomposition principles, i.e., construct-ing a converging sequence of valid upper and lower bounds through the solution of parametric primal and master subproblems. The solution is characterized in different sub-domains of the uncertain parameter space by (i) linear parametric profiles, and (ii) the corresponding integer solutions. 1998 Elsevier Science Ltd. All rights reserved.