Category:Vanishing constraints

From mintOC
Revision as of 13:14, 20 November 2010 by SebastianSager (Talk | contribs) (Initial setup of IMA paper text)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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}

with smooth functions g, h: \R^{n_y} \mapsto \R^m 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.