Skip to main content
SpringerLink
Log in

On the basic theorem of complementarity

  • Published:
Mathematical Programming Submit manuscript

Abstract

Using a fixed point theorem of Browder, the basic existence theorem of Lemke in linear complementarity theory is generalized to the nonlinear case.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F.W. Browder, “On continuity of fixed points under deformation of continuous mappings,”Summa Brasil, Math. 4 (1960).

  2. R.W. Cottle, “Nonlinear programs with positively bounded Jacobians”,SIAM Journal of Applied Mathematics 14 No. 1 (1966).

    Google Scholar 

  3. R.W. Cottle and G.B. Dantzig, “Complementary Pivot theory of mathematical programming”,Linear Algebra and its applications 1 (1968).

  4. B.C. Eaves, “The linear complementarity problem”, Working paper No. 275, Center for Research in Management Science, University of California, Berkeley, Calif. (August, 1969),Management Science 17, No. 9 (May 1971).

    Google Scholar 

  5. B.C.Eaves, An odd theorem,Proceedings of the American Mathematical Society 26, No. 3 (1970).

  6. P.Hartman and G.Stampacchia, “On some nonlinear differential-functional equations”,Acta Mathematica 115 (1966).

  7. S.Karamardian, “Duality in mathematical programming”, Operations Research Center, University of California, Berkeley, Calif. (1966), or Parts 1 and 2 or “The nonlinear complementarity problem with applications”,JOTA 4, Nos. 2 and 3 (1969).

    Google Scholar 

  8. S. Karamardian, “The complementarity problem”, Grad. School of Admin. and Math. Dept., University of California, Irvine, Calif.,Mathematical Programming 1, No. 3 (1971) to appear.

  9. C.E.Lemke, “Bimatrix equilibrium points and mathematical programming,Management Science 11, No. 7 (1965).

  10. C.E. Lemke, “Recent results on complementarity problems”, Math. Dept. Rensselaer Polytechnic Institute.

  11. H.Scarf and T.Hansen, “On the applications of a recent combinatorial algorithm, “Cowles Commission Discussion Paper No. 272 (April 1969).

  12. R.Wilson, “Computing equilibria ofN-person games”, Grad. School of Business, Stanford University, Stanford. Calif.

Download references

Author information

Authors and Affiliations

  1. Stanford University, Stanford, California, USA

    B. C. Eaves

Authors
  1. B. C. Eaves
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by the National Science Foundation Grand GK-5695 and by the Army Research Office — Durham, Contract DAHC 04-67-C-0028.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eaves, B.C. On the basic theorem of complementarity. Mathematical Programming 1, 68–75 (1971). https://doi.org/10.1007/BF01584073

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation