Difference between revisions of "Category:Vanishing constraints"
From mintOC
m (Initial setup of IMA paper text) |
(No difference)
|
Revision as of 14:14, 20 November 2010
This category contains mathematical programs with vanishing constraints (MPVCs). The problem
![\begin{array}{llcl}
\displaystyle \min_{y} & & & \Phi(y) \\[1.5ex]
\mbox{s.t.} & 0 & \ge & g_i(y) h_i(y), \quad i \in \{1, \dots, m\}\\
& 0 & \le & \le h(y) \\
\end{array}](https://mintoc.de/images/math/e/3/4/e34bf81c680f860655fecd6237d2d2a2.png)
with smooth functions 
is called MPVC. Note that every MPVC can be transformed into an MPEC <bibref>Achtziger2008</bibref><bibref>Izmailov2009</bibref>. Examples for vanishing constraints are engine speed constraints that are only active if the corresponding gear control is nonzero.
References
<bibreferences/>
Pages in category "Vanishing constraints"
This category contains only the following page.
