Skip to main content
Log in

Ky Fan's N-matrices and linear complementarity problems

  • Published:
Mathematical Programming Submit manuscript

Abstract

We consider the linear complementarity problem (LCP),w=Az + q, w⩾0,z⩾0,w T z=0, when all the off-diagonal entries ofA are nonpositive (the class of Z-matrices), all the proper principal minors ofA are positive and the determinant ofA is negative (the class of almost P-matrices). We shall call this the class of F-matrices. We show that ifA is a Z-matrix, thenA is an F-matrix if and only if LCP(q, A) has exactly two solutions for anyq⩾0,q≠0, and has at most two solutions for any otherq.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. Berman and R.J. Plemons,Nonnegative Matrices in the Mathematical Sciences (Academic Press, New York, 1979).

    Google Scholar 

  2. R.W. Cottle, J.S. Pang and R.E. Stone,The Linear Complementarity Problem (Academic Press, Boston, MA, 1992).

    Google Scholar 

  3. K. Fan, “Some matrix inequalities,”Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 29 (1966), 185–196.

    Google Scholar 

  4. M.S. Gowda, “Applications of degree theory to linear complementarity problems,” Research Report 91-14, Department of Mathematics, University of Maryland Baltimore County (Catonsville, MD, 1991).

    Google Scholar 

  5. G.A. Johnson, “A generalization of N-matrices,”Linear Algebra and its Applications 48 (1982) 201–217.

    Google Scholar 

  6. M. Kojima and R. Saigal, “On the number of solutions to a class of linear complementarity problems,”Mathematical Programming 17 (1979) 136–139.

    Google Scholar 

  7. S.R. Mohan and R. Sridhar, “On characterizing N-matrices using linear complementarity,”Linear Algebra and its Applications 160 (1992) 231–245.

    Google Scholar 

  8. K.G. Murty, “On the number of solutions to the complementarity problem and spanning properties of complementary cones,”Linear Algebra and its Applications 5 (1972) 65–108.

    Google Scholar 

  9. H. Nikaido,Convex Structures and Economic Theory (Academic Press, New York, 1968).

    Google Scholar 

  10. C. Olech, T. Parthasarathy and G. Ravindran, “Almost N-matrices and linear complementarity,”Linear Algebra and its Applications 145 (1991) 107–125.

    Google Scholar 

  11. T. Parthasarathy and G. Ravindran, “N-matrices,”Linear Algebra and its Applications 139 (1990) 89–102.

    Google Scholar 

  12. R. Saigal, “On the class of complementary cones and Lemke's algorithm,”SIAM Journal on Applied Mathematics 23 (1972) 46–60.

    Google Scholar 

  13. H. Samelson, R.M. Thrall and O. Wesler, “A partition theorem for Euclideann-space,”Proceedings of the American Mathematical Society 9 (1958) 805–807.

    Google Scholar 

  14. S. Xu, “Sign-reversal property for F-matrices and N-matrices,” unpublished manuscript.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research supported by AFOSR-89-0512.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Miao, J. Ky Fan's N-matrices and linear complementarity problems. Mathematical Programming 61, 351–356 (1993). https://doi.org/10.1007/BF01582156

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01582156

Key words