Nonlinear complementarity problem: Difference between revisions

Revision as of 16:08, 3 April 2010

Revision as of 13:01, 5 May 2014

Line 1:

{{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

Line 10 ⟶ 12:

url=http://www.informaworld.com/smpp/content~db=all~content=a905306577|accessdate=2010-03-13}}

* {{cite book|last1=Cottle|first1=Richard W.|last2=Pang|first2=Jong-Shi|last3=Stone|first3=Richard E.|title=The linear complementarity problem | series=Computer Science and Scientific Computing|publisher=Academic Press, Inc.|___location=Boston, MA|year=1992|pages=xxiv+762 pp.|isbn=0-12-192350-9}} {{MR|1150683}}

{{Mathematical programming}}