Revision as of 23:03, 9 June 2008 edit TotientDragooned (talk \| contribs) Extended confirmed users 696 edits expanded the article ← Previous edit		Revision as of 07:13, 24 June 2008 edit undo Delaszk (talk \| contribs) 1,194 edits No edit summary Next edit →
Line 19: Although any quadratic programming algorithm can solve an LCP, there exist more efficient, specialized algorithms, such as [[Lemke's algorithm]] and [[Dantzig's algorithm]], for the case that '''M''' is symmetric positive-semidefinite. ==See also== *[[Complementarity theory]] ==Further reading==

Linear complementarity problem: Difference between revisions