Skip to main content
SpringerLink
Log in

A note on linear complementarity problems and multiple objective programming

  • Published:
Mathematical Programming Submit manuscript

Abstract.

Kostreva and Wiecek [3] introduced a problem called LCP-related weighted problem in connection with a multiple objective programming problem, and suggested that a given linear complementarity problem (LCP) can be solved by solving the LCP-related weighted problem associated with it. In this note we provide several clarifications of the claims made in [3]. Finally, we feel that solving any LCP by the approach given in [3] may not be as useful as it is claimed.

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. Bazaraa, M.S., Shetty, C.M.: Nonlinear Programming: Theory and algorithm. John Wiley & Sons, New York, 1979

  2. Cottle, R.W., Pang, J.S., Stone, R.E.: The linear complementarity problem. Academic Press, New York, 1992

  3. Kostreva, M.K., Wiecek, M.W.: Linear complementarity problems and multiple objective programming. Math. Program. 60, 349–359 (1993)

    MathSciNet  MATH  Google Scholar 

  4. Isac, G., Kostreva, M.K., Wiecek, M.W.: Multiple-objective approximation of feasible but unsolvable linear complementarity problems. J. optim. theory and applications 86, 389–405 (1995)

    MathSciNet  MATH  Google Scholar 

  5. Lemke, C.E.: Bimatrix equilibrium points and mathematical Programming. Manage. Sci. 11, 681–689 (1965)

    MATH  Google Scholar 

  6. Lemke, C.E., Howson, J.T.: Equilibrium points of bimatrix games. J. Soc. Industrial and Appl. Math. 12, 413–423 (1964)

    MATH  Google Scholar 

  7. Mangasarian, O.L.: Characterization of linear complementarity problems as linear programs. Math. Program. study 7, 74–87 (1978)

    MATH  Google Scholar 

  8. Murty, K.G.: Linear Complementarity, Linear and Nonlinear Programming. Heldermann Verlag, West Berlin, 1988

Download references

Author information

Authors and Affiliations

  1. Indian Statistical Institute, New Delhi, 110016

    S.R. Mohan & S.K. Neogy

  2. Indian Statistical Institute, Calcutta, 700 035

    A.K. Das

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. A.K. Das
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S.R. Mohan.

Additional information

Mathematics Subject Classification (2000): 90C33

Received: October 1998 / Revised version: August 2003

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mohan, S., Neogy, S. & Das, A. A note on linear complementarity problems and multiple objective programming. Math. Program., Ser. A 100, 339–344 (2004). https://doi.org/10.1007/s10107-003-0473-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-003-0473-8

Keywords

Search

Navigation