Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

On the number of solutions to a class of complementarity problems

  • Published:
Mathematical Programming Submit manuscript

Abstract

In this paper we consider the problem of establishing the number of solutions to the complementarity problem. For the case when the Jacobian of the mapping has all principal minors negative, and satisfies a condition at infinity, we prove that the problem has either 0, 1, 2 or 3 solutions. We also show that when the Jacobian has all principal minors positive, and satisfies a condition at infinity, the problem has a unique solution.

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. R.W. Cottle, “Nonlinear programs with positively bounded Jacobians”,SIAM Journal on Applied Mathematics 14 (1966) 147–158.

    Google Scholar 

  2. D. Gale and H. Nikaido, “The Jacobian matrix and global univalence of mappings”,Mathematische Annalen 159 (1965) 81–93.

    Google Scholar 

  3. K. Inada, “Factor intensity and Stolper—Samuelson condition”, mimeographed (1966).

  4. S. Karamardian, “The complementarity problem”,Mathematical Programming 2 (1972) 107–129.

    Google Scholar 

  5. M. Kojima, “A unification of existence theorems of the nonlinear complementarity problem”,Mathematical Programming 9 (1975) 257–277.

    Google Scholar 

  6. M. Kojima, “Studies on piecewise linear approximations of piecewise-C1 mappings in fixed points and complementarity theory”,Mathematics of Operational Research 3 (1978) 17–36.

    Google Scholar 

  7. M. Kojima and R. Saigal, “A study of PC1 homeomorphisms on subdivided polyhedrons”,SIAM Journal on Mathematical Analysis 10 (1979) 1299–1312.

    Google Scholar 

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

    Google Scholar 

  9. O.L. Mangasarian, “Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems”, Computer Sciences Technical Report No. 375, Univ. of Wisconsin, Madison, WI (February 1979).

    Google Scholar 

  10. A. Mas-Colell, “Homeomorphisms of compact convex sets and the Jacobian matrix”,SIAM Journal on Mathematical Analysis 10 (1979) 1105–1109.

    Google Scholar 

  11. N. Megiddo and M. Kojima, “On the existence and uniqueness of solutions in the nonlinear complementarity theory”,Mathematical Programming 12 (1977) 110–130.

    Google Scholar 

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

    Google Scholar 

  13. H. Nikaido,Convex structures and economic theory (Academic Press, New York, 1968).

    Google Scholar 

  14. J.M. Ortega and W.C. Rheinboldt,Iterative solutions of nonlinear equations in several variables (Academic Press, New York, 1970).

    Google Scholar 

  15. W.C. Rheinboldt and J.S. Vandergraft, “On piecewise affine mappings inR n”,SIAM Journal on Applied Mathematics 29 (1975) 680–689.

    Google Scholar 

  16. R. Saigal and C.B. Simon, “Generic properties of the complementarity problem”,Mathematical Programming 4 (1973) 324–335.

    Google Scholar 

  17. 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 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Sponsored by the United States Army under Contract No. DAAG29-75-C-0024. This material is based upon work supported by the National Science Foundation under Grant No. MCS77-03472 and Grant No. MCS78-09525. This work appeared as an MRC Technical Report No. 1964, University of Wisconsin, Madison, WI, June 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kojima, M., Saigal, R. On the number of solutions to a class of complementarity problems. Mathematical Programming 21, 190–203 (1981). https://doi.org/10.1007/BF01584240

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words