# An extension of Lemke’s method for the solution of a generalized Linear Complementarity Problem

• Joaquim J. Júdice
• Ana M. Faustino
II Mathematical Programming II.3 Linear Programming And Complementarity
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 180)

## Abstract

In this paper an extension of Lemke’s method for the solution of the Linear Complementarity Problem with Bounds (BLCP) is presented. This problem consists of finding vectors z∈Rn and w∈Rn such that
$$\begin{gathered}w = q + Mz \hfill \\a_i \leqslant z_i \leqslant b_i \hfill \\z_i = a_i \Rightarrow w_i \geqslant 0 i = 1,...,n \hfill \\z_i = b_i \Rightarrow w_i \leqslant 0 \hfill \\a_i < z_i < b_i \Rightarrow w_i = 0 \hfill \\\end{gathered}$$
where q∈Rn and M∈Rn×n are given and −∞≤ai<bi≤+∞ for all i=1,..., n. It is shown that the algorithm can process the BLCP when M is a positive semi-definite matrix or when all the bounds ai and bi are finite. The performance of the algorithm for the solution of large-scale BLCPs is briefly discussed.

## References

1. 
B.H. Ahn, Iterative methods for linear complementarity problems with upper-bounds on primary variables, Mathematical Programming 26 (1983) 295–315.
2. 
R.C. Bland, New finite pivoting rules for the simplex method, Mathematics of Operations Research 2 (1977) 103–107.
3. 
J.J.Júdice and A.M.Faustino, Solution of large-scale convex quadratic programs by Lemke’s method, to appear in "Proceedings of the Conference in Optimization and Statistics", Tróia, Portugal, 1991.Google Scholar
4. 
J.J. Júdice and F.M. Pires, Direct methods for convex quadratic programs subject to box constraints, Investigaçāo Operacional 9 (1989) 23–56.Google Scholar
5. 
C.E. Lemke, On complementary pivot theory, in "Mathematics of Decision Sciences", edited by G.B. Dantzig and A.F. Veinott Jr., American Mathematical Society, Providence, pp.95–113.Google Scholar
6. 
H.J. Lüthi, Linear Complementarity Problems with upper-bounds, European Journal of Operational Research 40 (1989) 337–343.
7. 
J.J. Moré and G. Toraldo, Algorithms for bound constrained quadratic programming problems, Numerische Mathematik 55 (1989) 377–400.
8. 
K.G. Murty, Linear Complementarity, Linear and Nonlinear Programming, Heldermann Verlag, Berlin, 1988.
9. 
P.M. Pardalos, Y. Ye and C.G. Han, An interior-point algorithm for large-scale quadratic programs with box constraints, Lecture Notes in Control and Information 144, Springer-Verlag, Berlin, 1990, pp.413–422.Google Scholar
10. 
R.W.H. Sargent, An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower bounds, Mathematical Programming Study 7 (1978) 36–54.
11. 
G. Van der Laan and A.J.J. Talman, An algorithm for the linear complementarity problem with upper and lower bounds, Journal of Optimization Theory and Applications 62 (1989) 151–163.

© International Federation for Information Processing 1992

## Authors and Affiliations

• Joaquim J. Júdice
• 1