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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.