Revision as of 19:25, 3 December 2023 edit OAbot (talk \| contribs) Bots 643,717 edits m Open access bot: hdl updated in citation with #oabot. ← Previous edit		Latest revision as of 12:01, 30 March 2025 edit undo Widefox (talk \| contribs) Autopatrolled, Extended confirmed users, Page movers, IP block exemptions, New page reviewers, Pending changes reviewers, Rollbackers 110,634 edits m →top: def acro per MOS
Line 1: {{Short description\|Mathematics problem}} 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 : <math>x \geq 0,\ f(x) \geq 0 \text{ and } x^{T}f(x)=0 </math>

Nonlinear complementarity problem: Difference between revisions