Sign-solvable linear complementarity problems

Abstract This paper presents a connection between qualitative matrix theory and linear complementarity problems (LCPs). An LCP is said to be sign-solvable if the set of the sign patterns of the solutions is uniquely determined by the sign patterns of the given coefficients. We provide a characterization for sign-solvable LCPs such that the coefficient matrix has nonzero diagonals, which can be tested in polynomial time. This characterization leads to an efficient combinatorial algorithm to find the sign pattern of a solution for these LCPs. The algorithm runs in O ( γ ) time, where γ is the number of the nonzero coefficients.

[1]  Gregory E. Coxson,et al.  The P-matrix problem is co-NP-complete , 1994, Math. Program..

[2]  Bryan L. Shader,et al.  Linear systems with signed solutions , 2000 .

[3]  V. Klee.  Recursive structure of S-matrices and an O(m2) algorithm for recognizing strong sign solvability , 1987 .

[4]  C. E. Lemke,et al.  Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[5]  Bryan L. Shader,et al.  On matrices which have signed null-spaces , 2002 .

[6]  William McCuaig,et al.  Pólya's Permanent Problem , 2004, Electron. J. Comb..

[7]  Katta G. Murty,et al.  Some NP-complete problems in linear programming , 1982, Oper. Res. Lett..

[8]  S. J. Chung.  NP-Completeness of the linear complementarity problem , 1989 .

[9]  Richard W. Cottle,et al.  Linear Complementarity Problem. , 1992 .

[10]  N. Biggs.  MATCHING THEORY (Annals of Discrete Mathematics 29) , 1988 .

[11]  Klaus G. Fischer,et al.  Mixed matrices and binomial ideals , 1996 .

[12]  Jia-Yu Shao,et al.  Some properties of matrices with signed null spaces , 2004, Discret. Math..

[13]  G. Dantzig,et al.  COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .

[14]  Satoru Iwata,et al.  Solving linear programs from sign patterns , 2008, Math. Program..

[15]  Walter D. Morris,et al.  Mixed dominating matrices , 1998 .

[16]  Robin Thomas,et al.  PERMANENTS, PFAFFIAN ORIENTATIONS, AND EVEN DIRECTED CIRCUITS , 1997, STOC 1997.

[17]  Richard A. Brualdi,et al.  Matrices of Sign-Solvable Linear Systems , 1995 .

[18]  J. Rohn.  Systems of linear interval equations , 1989 .

[19]  Mihalis Yannakakis,et al.  Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs , 1989, Discret. Appl. Math..

[20]  Paul D. Seymour,et al.  Characterization of even directed graphs , 1987, J. Comb. Theory, Ser. B.

[21]  J T J van Eijndhoven,et al.  Solving the linear complementarity problem in circuit simulation , 1986 .