Content deleted Content added
ce |
|||
Line 1:
{{orphan|date=February 2015}}
'''Parametric programming''' is a type of [[mathematical optimization]], where the [[optimization problem]] is solved as a function of one or multiple [[parameters]].<ref>Tomas Gal. Postoptimal analyses, parametric programming, and related topics: Degeneracy, multicriteria decision making, redundancy. Berlin : W. de Gruyter, 1995.</ref> Developed in parallel to [[sensitivity analysis]], its earliest mention can be found in a [[thesis]] from 1952.<ref>T Gal, H.J. Greenberg Advances in Sensitivity Analysis and Parametric Programming. Springer, 1997.</ref> Since then, there have been considerable developments for the cases of multiple parameters, presence of [[integer]] variables as well as nonlinearities. In particular the connection between parametric programming and [[model predictive control]] established in 2000 has contributed to an increased interest in the topic.<ref>
== Notation ==
Line 19:
Depending on the nature of <math>f(x,\theta)</math> and <math>g(x,\theta)</math> and whether the optimization problem features integer variables, parametric programming problems are classified into different sub-classes:
* If more than one parameter is present, i.e. <math>m > 1</math>, then it is often referred to as multiparametric programming problem<ref>{{cite journal|last1=Gal
* If integer variables are present, then the problem is referred to as (multi)parametric mixed-integer programming problem<ref>{{cite journal|last1=Dua
* If constraints are [[Affine transformation|affine]], then additional classifications depending to nature of the objective function in (multi)parametric (mixed-integer) linear, quadratic and nonlinear programming problems is performed. Note that this generally assumes the constraints to be affine.<ref>Pistikopoulos, Efstratios N.; Georgiadis, Michael C.; Dua, Vivek Multi-parametric programming: Theory, algorithms and applications. Weinheim, Wiley-VCH, 2007.</ref>
|