Revision as of 00:42, 11 May 2014 edit LukasMatt (talk \| contribs) Extended confirmed users 2,225 edits Dead-end pages clean up project; you can help! ← Previous edit		Revision as of 02:57, 13 February 2017 edit undo Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 473,387 edits m clean up, merge identifier with template, and/or remove accessdate if no url, added underlinked tag using AWB Next edit →
Line 1: {{Underlinked\|date=February 2017}} In [[applied mathematics]], a '''nonlinear complementarity problem (NCP)''' with respect to a mapping ''&fnof;'' : '''R'''<sup>''n''</sup> → '''R'''<sup>''n''</sup>, denoted by NCP''&fnof;'', is to find a vector ''x'' ∈ '''R'''<sup>''n''</sup> such that Line 9 ⟶ 11: * {{cite paper\|author=Stephen C. Billups\|title=A new homotopy method for solving non-linear complementarity problems\|date=2008\| 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~~\|MR=1150683}} {{Mathematical programming}} [[Category:Mathematical optimization]] {{applied-math-stub}}

Nonlinear complementarity problem: Difference between revisions