Difference between revisions of "Category:Equilibrium constraints"
From mintOC
m (Correction) |
m |
||
Line 14: | Line 14: | ||
where <math>Y(y_1)</math> is the feasible region for the variational inequality and given function <math>\phi(\cdot)</math>. Variational inequalities arise in many domains and are generally referred to as equilibrium constraints. The variables <math>y_1</math> and <math>y_2</math> may be controls or states. | where <math>Y(y_1)</math> is the feasible region for the variational inequality and given function <math>\phi(\cdot)</math>. Variational inequalities arise in many domains and are generally referred to as equilibrium constraints. The variables <math>y_1</math> and <math>y_2</math> may be controls or states. | ||
− | [[:Category:Complementarity constraints | Complementarity constraints]] are | + | [[:Category:Complementarity constraints | Complementarity constraints]] and [[:Category:Vanishing constraints | vanishing constraints]] are special cases. |
[[Category:Objective characterization]] | [[Category:Objective characterization]] |
Latest revision as of 13:15, 20 November 2010
This category contains mathematical programs with equilibrium constraints (MPECs). An MPEC is an optimization problem constrained by a variational inequality, which takes for generic variables / functions the following general form:
where is the feasible region for the variational inequality and given function . Variational inequalities arise in many domains and are generally referred to as equilibrium constraints. The variables and may be controls or states.
Complementarity constraints and vanishing constraints are special cases.
This category currently contains no pages or media.