A multiparametric programming approach for mixed-integer quadratic engineering problems

doi:10.1016/S0098-1354(01)00797-9

2002-05-01

164

PRE

Dua, V

Nikolaos A. Bozinis

Efstratios N. Pistikopoulos

DOI：10.1016/S0098-1354(01)00797-9

原文链接

原文求助

摘要

En 中文

In this work we propose algorithms for the solution of multiparametric quadratic programming (mp-QP) problems and multiparametric mixed-integer quadratic programming (mp-MIQP) problems with a convex and quadratic objective function and linear constraints. For mp-QP problems it is shown that the optimal solution, i.e. the vector of continuous variables and Lagrange multipliers, is an affine function of parameters. The basic idea of the algorithm is to use this affine expression for the optimal solution to systematically characterize the space of parameters by a set of regions of optimality. The solution of the mp-MIQP problems is approached by decomposing it into two subproblems, which converge based upon an iterative methodology. The first subproblem, which is an mp-QP, is obtained by fixing the integer variables and its solution represents a parametric upper bound. The second subproblem is formulated as a mixed-integer non-linear programming (MINLP) problem and its solution provides a new integer vector, which can be fixed to obtain a parametric solution, which is better than the current upper bound. The algorithm terminates with an envelope of parametric profiles corresponding to different optimal integer solutions. Examples are presented to illustrate the basic ideas of the algorithms and their application in model predictive and hybrid control problems. (C) 2002 Elsevier Science Ltd. All rights reserved.

Keyword:

parametric mixed-integer quadratic programming

sensitivity analysis