Abstract
Recently, Mangasarian [18, 19] has discussed the idea of solving certain classes of linear complementarity problems as linear programs. The present paper (1) demonstrates how these complementarity problems are related to the theory of polyhedral sets having least elements and (2) discusses the question of whether the linear programming approach can be recommended for solving them.
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.
