Iterative Scheme for Linear Complementarity Problems

摘要

The linear complementarity problem (LCP) is an important problem in mathematical programming for solving linear programming, quadratic programming and bimatrix games. This work gives a new scheme for solving the LCP. Based on the scheme different algorithms may be designed for finding approximate solutions of very large scale problems or exact solutions of moderate LCPs. A specific algorithm for the latter is given, together with some numerical results. These indicate that the method is more effective than other existing methods.