Namespaces
Variants
Actions

Difference between revisions of "Passive constraint"

From Encyclopedia of Mathematics
Jump to: navigation, search
(TeX)
(Category:Operations research, mathematical programming)
 
Line 11: Line 11:
  
 
See also [[Active constraint|Active constraint]]. For a selection of references, see [[Mathematical programming|Mathematical programming]].
 
See also [[Active constraint|Active constraint]]. For a selection of references, see [[Mathematical programming|Mathematical programming]].
 +
 +
[[Category:Operations research, mathematical programming]]

Latest revision as of 17:58, 14 October 2014

inactive constraint

Let be given a constrained optimization problem

maximize $f(x)$, $x\in\mathbf R^n$

subject to $g_i(x)\leq0$, $i=1,\ldots,m$.

The $i$th constraint is said to be passive (at a solution $y$) if $g_i(y)<0$.

See also Active constraint. For a selection of references, see Mathematical programming.

How to Cite This Entry:
Passive constraint. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Passive_constraint&oldid=31918
This article was adapted from an original article by M. Hazewinkel (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article