Abstract
We apply a potential reduction algorithm to solve the general linear complementarity problem GLCP minimizeâ x Ty subject toâ Ax + By + Cz = q â andâ x , y , z â 0. We show that the algorithm is a f...
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
