Abstract
This chapter describes the computation of stationary points. It discusses the application of Lemkes algorithm to the augmented linear complementarity problem. To initiate the algorithm, one needs lexico nonnegative row by row. It is found that if it is merely lexico nonnegative, and not lexico positive, then Lemkes algorithm may terminate on a ray that is identical to the primary ray after the perturbation is dropped. Upon dropping the perturbation, it is found that the secondary ray of the perturbed problem becomes the primary ray of the original problems.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
