Skip to main content
SpringerLink
Log in

Two counterexamples on the polynomial solvability of the linear complementarity problem

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

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

References

  1. R. Chandrasekaran and S. N. Kabadi, “Strongly polynomial algorithms for a class of combinatorial LCP's,” to appear inOperations Research Letters (1987).

  2. S.J. Chung and K.G. Murty, “Polynomially bounded ellipsoid algorithms for convex quadratic programming,” in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear programming 4 (Academic Press, 1981) pp. 487–518.

  3. R.W. Cottle, “Monotone solutions of the parametric linear complementarity problem,”Mathematical Programming 3 (1972) 210–214.

    Article  MATH  MathSciNet  Google Scholar 

  4. M.K. Kozlov, S.P. Tarasov and I.G. Hachijan, “Polynomial solvability of convex quadratic programming,”Soviet Mathematics Doklady 20 (1979) 1108–1111.

    MATH  Google Scholar 

  5. K.G. Murty, “On the parametric complementarity problems,” Technical Report, The University of Michigan (Ann Arbor, Michigan, 1977).

    Google Scholar 

  6. J.-S. Pang and R. Chandrasekaran, “Linear complementarity problems solvable by a polynomially bounded pivoting algorithm,”Mathematical Programming Study 25 (1985) 13–27.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Management, The University of Texas at Dallas, Box 830688, 75083-0688, Richardson, TX, USA

    R. Chandrasekaran & Jong-Shi Pang

  2. AT&T Bell Laboratories, Room HO 3K-328, Crawfords Corner Road, 07733, Holmdel, NJ, USA

    Richard E. Stone

Authors
  1. R. Chandrasekaran
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jong-Shi Pang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Richard E. Stone
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work of Chandrasekaran was supported by the National Science Foundation under grant NSF(SFC) #INT 8521713.

The work of Pang was supported by the National Science Foundation under grant ECS-8407240.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chandrasekaran, R., Pang, JS. & Stone, R.E. Two counterexamples on the polynomial solvability of the linear complementarity problem. Mathematical Programming 39, 21–25 (1987). https://doi.org/10.1007/BF02592069

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation