Skip to main content
SpringerLink
Log in

Finiteness of Criss-Cross Method in Complementarity Problem

  • Conference paper
  • First Online:
Mathematics and Computing (ICMC 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 655))

Included in the following conference series:

Abstract

In this paper we consider criss-cross method for finding solution of a linear complementarity problem. The criss-cross method is a pivoting procedure. We show that the criss-cross method is able to compute solution of a linear complementarity problem in finite steps in case of some new matrix classes. We present a numerical illustration to show a comparison between criss-cross method and Lemke’s algorithm with respect to number of iterations before finding a solution. Finally we raise an open problem in the context of criss-cross method.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  1. Bland, R.G.: New finite pivoting rules for the simplex method. Math. Oper. Res. 2(2), 103–107 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chang, Y.Y.: Least-index resolution of degeneracy in linear complementarity problems (No. TR-79-14), Department of Operations Research, Stanford University (1979)

    Google Scholar 

  3. Cottle, R.W.: The principal pivoting method revisited. Math. Program. 48(1), 369–385 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cottle, R.W., Guu, S.M.: Two characterizations of sufficient matrices. Linear Algebra Appl. 170, 65–74 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem. SIAM, Philadelphia (2009)

    Book  MATH  Google Scholar 

  6. Crouzeix, J.P., Komlósi, S.: The linear complementarity problem and the class of generalized positive subdefinite matrices. In: Giannessi, F., Pardalos, P., Rapcsák, T. (eds.) Optimization Theory, pp. 45–63. Springer, New York (2001)

    Google Scholar 

  7. Crouzeix, J.P., Hassouni, A., Lahlou, A., Schaible, S.: Positive subdefinite matrices, generalized monotonicity, and linear complementarity problems. SIAM J. Matrix Anal. Appl. 22(1), 66–85 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  8. Fukuda, K., Lüthi, H.J., Namiki, M.: The existence of a short sequence of admissible pivots to an optimal basis in LP and LCP. Int. Trans. Oper. Res. 4(4), 273–284 (1997)

    Article  MATH  Google Scholar 

  9. Gowda, M.S.: Affine pseudomonotone mappings and the linear complementarity problem. SIAM J. Matrix Anal. Appl. 11(3), 373–380 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hertog, D., Roos, C., Terlaky, T.: The linear complimentarity problem, sufficient matrices, and the criss-cross method. Linear Algebra Appl. 187, 1–14 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  11. Klafszky, E., Terlaky, T.: Some generalizations of the criss-cross method for quadratic programming. Optimization 24(1–2), 127–139 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  12. Martos, B.: Subdefinite matrices and quadratic forms. SIAM J. Appl. Math. 17(6), 1215–1223 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mohan, S.R., Neogy, S.K., Das, A.K.: On the classes of fully copositive and fully semimonotone matrices. Linear Algebra Appl. 323(1), 87–97 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  14. Murthy, G.S.R., Parthasarathy, T.: Fully copositive matrices. Math. Program. 82(3), 401–411 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  15. Murty, K.G., Yu, F.T.: Linear Complementarity, Linear and Nonlinear Programming. Heldermann, Berlin (1988)

    MATH  Google Scholar 

  16. Neogy, S.K., Das, A.K.: Some properties of generalized positive subdefinite matrices. SIAM J. Matrix Anal. Appl. 27(4), 988–995 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ramamurthy, K.G.: A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices. Linear Algebra Appl. 83, 39–47 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  18. Wang, Z.M.: A finite conformal-elimination free algorithm over oriented matroid programming. Chin. Ann. Math. Ser. B 8(1), 120–125 (1987)

    MathSciNet  MATH  Google Scholar 

  19. Xu, S.: Notes on sufficient matrices. Linear Algebra Appl. 191, 1–13 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  20. Zionts, S.: The criss-cross method for solving linear programming problems. Manag. Sci. 15(7), 426–445 (1969)

    Article  MATH  Google Scholar 

Download references

Acknowledgments

The second author R. Jana is thankful to the Department of Science and Technology, Govt. of India, INSPIRE Fellowship Scheme for financial support.

Author information

Authors and Affiliations

  1. SQC & OR Unit, Indian Statistical Institute, 203 B. T. Road, Kolkata, 700 108, India

    A. K. Das

  2. Department of Mathematics, Jadavpur University, Kolkata, 700 032, India

    R. Jana

  3. Department of Mathematics, Indian Institute of Information Technology, Design and Manufacturing, Jabalpur, 482 005, India

    Deepmala

Authors
  1. A. K. Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Jana
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Deepmala
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Jana .

Editor information

Editors and Affiliations

  1. Haldia Institute of Technology, Haldia, India

    Debasis Giri

  2. University of Central Florida, Orlando, Florida, USA

    Ram N. Mohapatra

  3. Freie Universität Berlin, Berlin, Germany

    Heinrich Begehr

  4. Fordham University, Bronx, New York, USA

    Mohammad S. Obaidat

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Das, A.K., Jana, R., Deepmala (2017). Finiteness of Criss-Cross Method in Complementarity Problem. In: Giri, D., Mohapatra, R., Begehr, H., Obaidat, M. (eds) Mathematics and Computing. ICMC 2017. Communications in Computer and Information Science, vol 655. Springer, Singapore. https://doi.org/10.1007/978-981-10-4642-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-4642-1_15

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-4641-4

  • Online ISBN: 978-981-10-4642-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation