Please use this identifier to cite or link to this item:
|Title:||An enumerative method for the solution of linear complementarity problems|
|Citation:||Maths Technical Papers (Brunel University). April 1983, pp 1-29|
|Abstract:||In this report an enumerative method for the solution of the Linear Complementarity Problem (LCP) is presented. This algorithm completely processes the LCP, and does not require any particular property of the LCP to apply. That is the algorithm terminates after either finding all the solutions of an LCP or establishing that no solution exists. The method is extended to also process the Second Linear Complementarity Problem (SLCP), a problem which has been introduced to represent the general quadratic program involving unrestricted variables.|
|Appears in Collections:||Dept of Mathematics Research Papers|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.