Skip to main content
SpringerLink
Log in

Complementarity Pivot Methods

  • Chapter
Complementarity, Equilibrium, Efficiency and Economics

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 63))

  • 521 Accesses

Abstract

This chapter deals with pivot methods that constituted the first and important instrument in solving Linear Complementarity Problems. Developed under the impact of the simplex method, they revealed many crucial differences between the linear programming and complementarity problems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Chandrasekaran R. A special case of the complementarity pivot problem. Opsearch 1970; 7: 263–268.

    MathSciNet  Google Scholar 

  • Cottle RW. 1. Nonlinear programs with positively bounded Jacobians. SIAM J. Appl. Math. 1966; 14:147–158.

    Article  MathSciNet  MATH  Google Scholar 

  • Cottle RW. 2. On a problem in linear inequalities. J. London Math. Soc. 1968; 43:378–384.

    Article  MathSciNet  MATH  Google Scholar 

  • Cottle RW, and Dantzig GB. Complementarity pivot theory of mathematical programming. Linear Algebra and Its Applications. 1968; 1:103–125.

    Article  MathSciNet  MATH  Google Scholar 

  • Eaves, B.C. 1. “The linear complementarity problem in mathematical programming,” Research Report 69–4, Operations Research House, Stanford University, Stanford, California, 1969.

    Google Scholar 

  • Eaves, B.C. 2. The linear complementarity problem. Management Science. 1971; 17:612–634.

    Article  MathSciNet  MATH  Google Scholar 

  • Eaves, B.C. 3. On quadratic programming. Management Science. 1971; 17: 698–711.

    Article  MATH  Google Scholar 

  • Eaves, B.C. 4. ‘A short course in solving equations with PL homotopies.’- In: Nonlinear Programming, Vol. IX, SIAM-AMS Proceedings, R.W. Cottle and C.E. Lemke, eds. American Mathematical Society, Providence, 1976.

    Google Scholar 

  • Fiedler M, and Ptak V. On matrices with non-positive off-diagonal elements and positive principal minors. Czechoslovak Mathematical Journal. 1962; 12:382–400.

    Article  MathSciNet  Google Scholar 

  • Garcia CB. Some classes of matrices in linear complementarity theory. Math. Programming. 1973; 5:299–310.

    Article  MathSciNet  MATH  Google Scholar 

  • Habetler CJ, and Kostreva MM. On a direct algorithm for nonlinear complementarity problems. SIAM J. Control Optim. 1978; 16: 504–511.

    Article  MathSciNet  MATH  Google Scholar 

  • Habetler CJ, and Price AL. Existence theory for generalized nonlinear conplementarity problems. J. Optim. Theory Appl. 1971; 8:161–168.

    Article  MathSciNet  Google Scholar 

  • Herstein, I.N., Topics in Algebra. New York: Blaisdell, 1964.

    MATH  Google Scholar 

  • Kostreva, M.M. 1. “Direct algorithms for complementarity problems,” Ph.D. thesis, Rensselaer Polytechnic Institute, Troy, N.Y., 1976.

    Google Scholar 

  • Kostreva, M.M. 2. Block pivot methods for solving the complementarity problem. Linear Algebra and its Applications. 1978; 21: 207–215.

    Article  MathSciNet  MATH  Google Scholar 

  • Moré J. Coercivity conditions in nonlinear complementarity problems. SIAM Review. 1974; 16:1–15.

    Article  MathSciNet  MATH  Google Scholar 

  • Moré J, and Rheinboldt W. On P- and S-functions and related classes of n-dimensional nonlinear mappings. Linear Algebra and Applications. 1973; 6:45–68.

    Article  MATH  Google Scholar 

  • Ingleton AW. A problem in linear inequalities. Proc. London Math. Soc, Third Series. 1966; 16: 519–536.

    Article  MathSciNet  MATH  Google Scholar 

  • Lemke CB. 1. Bimatrix equilibrium points and mathematical programming. Management Science. 1965; 7:681–689.

    Article  MathSciNet  Google Scholar 

  • Lemke CB. 2. “On complementarity pivot theory,” RPI Math Report No. 76, Rensselaer Polytechnic Institute, Troy, New York, 1967.

    Google Scholar 

  • Lemke CB. 3. ‘On Complementarity Pivot Theory’.- In: Mathematics of the Decisidn Sciences, G.B. Dantzig and A.F. Veinott Jr., eds., American Mathematical Society, Providence, Rhode Island, 1968.

    Google Scholar 

  • Murty, K.G. 1. “On the number of solutions to the complementarity quadratic programming problem,” Doctoral Dissertation, Engineering Science, University of California, Berkeley, 1968.

    Google Scholar 

  • Murty, K.G. 2. Linear Complementarity, Linear and Nonlinear Programming. Berlin: Heldermann Verlag, 1988.

    MATH  Google Scholar 

  • Nash J. Non-cooperative games. Annals of Mathematics. 1951; 54:286–295.

    Article  MathSciNet  MATH  Google Scholar 

  • Ortega, J.M, and Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables. New York: Academic Press, 1970.

    MATH  Google Scholar 

  • Tamir A. Minimality and complementarity properties associated with Z-functioris and M-functions. Math. Programming. 1974; 7:17–31.

    Article  MathSciNet  MATH  Google Scholar 

  • Todd, M.J. 1. “Dual families of linear programs,” Technical Report No. 197, Department of Operations Research, Cornell University, 1973.

    Google Scholar 

  • Todd, M.J. 2. Extensions of Lemke’s algorithm for the linear complementarity problem. J. Optim. Theory Appl. 1976; 20:397–416.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Royal Military College of Canada, Kingston, Ontario, Canada

    G. Isac

  2. Central Economics Institute (CEMI) of Russian Academy of Sciences, Moscow, Russia

    V. A. Bulavsky & V. V. Kalashnikov

Authors
  1. G. Isac
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Bulavsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. V. Kalashnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Isac, G., Bulavsky, V.A., Kalashnikov, V.V. (2002). Complementarity Pivot Methods. In: Complementarity, Equilibrium, Efficiency and Economics. Nonconvex Optimization and Its Applications, vol 63. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3623-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3623-6_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5223-3

  • Online ISBN: 978-1-4757-3623-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation