Abstract Let M be an nth-order matrix and q and d be vectors, both of order n, and let ϑ be a scalar variable. Then the linear complementarity problem LCP ( q +ϑ d , M ) is defined to be: Determine a vector x ⩾ 0 such that w = Mx + q +ϑ d ⩾0 and x T w = 0 . It is shown that if M and d satisfy certain conditions, then every solution of LCP ( q +ϑ d , M ) , for all values of ϑ, lies on a graph where the solutions corresponding to nodes are degenerate and those corresponding to arcs are nondegenerate. Moreover, nodes are associated with particular values, while arcs are associated with open intervals of ϑ. Arcs emanating from a given node are shown to be determined by the solutions of two smaller LCP's involving Schur complements of M, and this enables inductive proofs to be constructed for some of the standard results, establishing relationships between the number of solutions for two different values of ϑ and, in the case where M is a P-matrix, uniqueness of the solutions.
[1]
C. E. Lemke,et al.
Bimatrix Equilibrium Points and Mathematical Programming
,
1965
.
[2]
Katta G. Murty,et al.
On the number of solutions to the complementarity problem and spanning properties of complementary cones
,
1972
.
[3]
B. Eaves.
The Linear Complementarity Problem
,
1971
.
[4]
O. L. Mangasarian,et al.
Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
,
1980,
Math. Program..
[5]
M. Fiedler,et al.
On matrices with non-positive off-diagonal elements and positive principal minors
,
1962
.