Nonlinear complementarity problem: Difference between revisions

Revision as of 13:01, 5 May 2014

Revision as of 00:42, 11 May 2014

Line 1:

In [[applied mathematics]], a '''nonlinear complementarity problem (NCP)''' with respect to a mapping ''ƒ'' : '''R'''^''n'' → '''R'''^''n'', denoted by NCP''ƒ'', is to find a vector ''x'' ∈ '''R'''^''n'' such that

{{Dead end|date=May 2014}}

In applied mathematics, a '''nonlinear complementarity problem (NCP)''' with respect to a mapping ''ƒ'' : '''R'''^''n'' → '''R'''^''n'', denoted by NCP''ƒ'', is to find a vector ''x'' ∈ '''R'''^''n'' such that

: <math>x \geq 0,\ f(x) \geq 0 \text{ and } x^{T}f(x)=0 \,</math>

Line 16 ⟶ 14:

[[Category:Mathematical optimization]]

{{applied-math-stub}}