A Characterization of the Constant Parity Property of the Number of Solutions to the Linear Complementarity Problem
暂无分享,去创建一个
We consider the linear complementarily problem: Given an $m \times m$ matrix M and a real m-vector q, find real m-vectors x and y which solve (i) $x = My + q,x\geqq 0,y\geqq 0$, (ii) $x^T y = 0$. In this paper we prove the necessary and sufficient conditions for the constant parity of the number of solutions to (i)–(ii) for all q for which every solution is nondegenerate. As a consequence we also derive the results of Murty [10], Karamardian [7] and Saigal [11].
[1] C. E. Lemke,et al. Bimatrix Equilibrium Points and Mathematical Programming , 1965 .
[2] G. Dantzig,et al. COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .
[3] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[4] David Gale. The theory of linear economic models , 1960 .