Revision as of 06:28, 29 January 2010 edit 152.7.1.64 (talk) →Relation to Quadratic Programming: - added bit about how to convert QP program to LCP ← Previous edit		Revision as of 16:43, 15 March 2010 edit undo Michael Hardy (talk \| contribs) Administrators 210,597 edits fixed incorrect capitals as required by WP:MOS Next edit →
Line 1: In mathematical [[optimization (mathematics)\|optimization theory]], the '''linear complementarity problem~~''',~~ ~~or '''~~(LCP)''', is a special case of [[quadratic programming]] which arises frequently in [[computational mechanics]]. == Formulation == Line 16: * <math>\mathbf{z}^{\mathrm{T}}(\mathbf{Mz}+\mathbf{q}) = 0</math> (the complementarity condition) ==Relation to ~~Quadratic~~quadratic ~~Programming~~programming== Finding a solution to the linear complementarity problem is equivalent to minimizing the quadratic function

Linear complementarity problem: Difference between revisions