The exact solution of multiparametric mixed-integer quadratic programming problems
Conference Paper
Overview
Identity
Additional Document Info
View All
Overview
abstract
In recent years, multiparametric programming in general and multiparametric mixed-integer quadratic programming (mp-MIQP) in particular has received a growing interest due to its applicability in areas such as explicit optimal control and reactive scheduling [1]. In general, mp-MIQP problems consist of a quadratic objective function z() subject to linear constraints and a polytopic parameter space. The corresponding solution is a partitioning of the feasible parameter space into a number of so-called critical regions CRi, each of which is associated with the corresponding optimal affine solution xi(), the optimal combination of binary variables yiand quadratic objective function zi().
