Skip to main content
SpringerLink
Log in

The generalized linear complementarity problem revisited

  • Published:
Mathematical Programming Submit manuscript

Abstract

Given a vertical block matrixA, we consider in this paper the generalized linear complementarity problem VLCP(q, A) introduced by Cottle and Dantzig. We formulate this problem as a linear complementarity problem with a square matrixM, a formulation which is different from a similar formulation given earlier by Lemke. Our formulation helps in extending many well-known results in linear complementarity to the generalized linear complementarity problem. We also show that the class of vertical block matrices which Cottle and Dantzig's algorithm can process is the same as the class of equivalent square matrices which Lemke's algorithm can process. We also present some degree-theoretic results on a vertical block matrix.

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. R. W. Cottle and G. B. Dantzig, “A generalization of the linear complementarity problem,”Journal of Combinatorial Theory 8 (1970) 79–90.

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  3. C. W. Cryer, “The method of Christopherson for solving free boundary problems for infinite journal bearings by means of finite differences,”Mathematics of Computation 25 (1971) 435–443.

    Article  MATH  MathSciNet  Google Scholar 

  4. N. Eagambaram and S. R. Mohan, “A note on the linear complementarity problem with anN 0-matrix,”The Arabian Journal for Science and Engineering 16 (1991) 341–345.

    MathSciNet  Google Scholar 

  5. B. C. Eaves, “The linear complementarity problem,”Management Science 17 (1971) 612–634.

    Article  MathSciNet  MATH  Google Scholar 

  6. A. A. Ebiefung and M. M. Kostreva, “Z-matrices and the generalized linear complementarity problem,” Technical Report #608, Department of Mathematical Sciences, Clemson University (South Carolina, 1991).

    Google Scholar 

  7. A. A. Ebiefung and M. M. Kostreva, “GeneralizedP 0- andZ-matrices,”Linear Algebra and its Applications 195 (1993) 165–179.

    Article  MATH  MathSciNet  Google Scholar 

  8. A. A. Ebiefung and M. M. Kostreva, “The generalized Leontief input-output model and Its application to the choice of new technology,”Annals of Operations Research 44 (1993) 161–172.

    Article  MATH  MathSciNet  Google Scholar 

  9. V. M. Fridman and V. S. Chernina, “An iteration process for the solution of the finite-dimensional contact problem,”U.S.S.R. Computational Mathematics and Mathematical Physics 7 (1967) 210–214.

    Article  Google Scholar 

  10. T. Fujisawa and E. S. Kuh, “Piecewise-linear theory of nonlinear networks,”SIAM Journal on Applied Mathematics 22 (1972) 307–328.

    Article  MATH  MathSciNet  Google Scholar 

  11. T. Fujisawa, E. S. Kuh and T. Ohtsuki, “A sparse matrix method for analysis of piecewise-linear resistiv networks,”IEEE Transactions on Circuit Theory 19 (1972) 571–584.

    MathSciNet  Google Scholar 

  12. M. S. Gowda and R. Sznajder, “The generalized order linear complementarity problem,”SIAM Journal on Matrix Analysis and Applications 15 (1994) 779–795.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. S. Gowda, “Applications of degree theory to linear complementarity problems,”Mathematics of Operations Research 18 (1993) 868–879.

    MATH  MathSciNet  Google Scholar 

  14. M. S. Gowda and R. Sznajder, “A generalization of the Nash equilibrium theorem on bimatrix games,” Research Report No. 93-11, Department of Mathematics, University of Maryland, 1993;International Journal of Game Theory, to appear.

  15. C. B. Garcia, “Some classes of matrices in linear complementarity theory,”Mathematical Programming 5 (1973) 299–310.

    Article  MATH  MathSciNet  Google Scholar 

  16. C. R. Glassey, “A quadratic network optimization model for equilibrium single commodity trade flows,”Mathematical Programming 14 (1978) 98–107.

    Article  MATH  MathSciNet  Google Scholar 

  17. C. E. Lemke, “Recent results on complementarity problems,” in: J. B. Rosen, O. L. Mangasarian and K. Ritter, eds.,Nonlinear Programming (Academic Press, New York, 1970) pp. 349–384.

    Google Scholar 

  18. C. E. Lemke, “Bimatrix equilibrium points and mathematical programming,”Management Science 11 (1965) 681–689.

    MathSciNet  Google Scholar 

  19. C. E. Lemke and J. T. Howson, “Equilibrium points of bimatrix games,”Journal of the Society for Industrial and Applied Mathematics 12 (1964) 413–423.

    Article  MATH  MathSciNet  Google Scholar 

  20. N. G. Lloyd,Degree Theory (Cambridge University Press, Cambridge, 1978).

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  23. K. G. Murty,Linear Complementarity, Linear and Nonlinear Programming (Heldermann, Berlin, 1988).

    MATH  Google Scholar 

  24. G. S. R. Murthy and T. Parthasarathy, “Characterization of fully-semimonotone,Q 0 matrices,” Technical Report #13, Indian Statistical Institute (Madras, India, 1993).

    Google Scholar 

  25. K. P. Oh, “The formulation of the mixed lubrication problem as a generalized nonlinear complementarity problem,”Transactions of ASME. Journal of Tribology 108 (1986) 598–604.

    Article  Google Scholar 

  26. J. S. Pang and S. C. Lee. “A parametric linear complementary technique for the computation of equilibrium prices in a single commodity spatial model,”Mathematical Programming 20 (1981) 81–102.

    Article  MATH  MathSciNet  Google Scholar 

  27. J. S. Pang, I. Kaneko and W. P. Hallman, “On the solution of some (parametric) linear complementarity problems with application to portfolio selection, structural engineering and actuarial graduation,”Mathematical Programming 16 (1979) 325–347.

    Article  MATH  MathSciNet  Google Scholar 

  28. T. D. Parsons,Applications of principal pivoting, Proceedings of the Princeton Symposium on Mathematical Programming (Princeton University Press, Princeton, NJ, 1970) pp. 567–581.

    Google Scholar 

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

    Google Scholar 

  30. M. Sun, “Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems,”Journal of Mathematical Analysis and Applications 144 (1989) 474–485.

    Article  MATH  MathSciNet  Google Scholar 

  31. M. Sun, “Singular control problems in bounded intervals,”Stochastics 21 (1987) 303–344.

    MATH  MathSciNet  Google Scholar 

  32. A. Tamir, “An application ofZ-matrices to a class of resource allocation problems,”Management Science 23 (1976) 317–323.

    MATH  MathSciNet  Google Scholar 

  33. M. J. Todd, “Orientation in complementary pivot algorithms,”Mathematics of Operations Research1 (1976) 54–66.

    MATH  MathSciNet  Google Scholar 

  34. L. Vandenberghe, B. L. De Moor and J. Vandewalle, “The generalized linear complementarity problem applied to the complete analysis of resistive piecewise-linear circuits,”IEEE Transactions on Circuits and Systems 11 (1989) 1382–1391.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Statistical Institute, 7, S. J. S. Sansanwal Marg, 110016, New Delhi, India

    S. R. Mohan & S. K. Neogy

  2. Indira Gandhi Institute of Development Research, 400 065, Bombay, India

    R. Sridhar

Authors
  1. S. R. Mohan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. K. Neogy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Sridhar
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mohan, S.R., Neogy, S.K. & Sridhar, R. The generalized linear complementarity problem revisited. Mathematical Programming 74, 197–218 (1996). https://doi.org/10.1007/BF02592211

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation