Lemke’s algorithm is a pivotal kind of algorithm which is developed based on principal pivot transform. We consider several matrix classes to study the relationship among them in the context of linear complementarity problem. These classes are important from Lemke’s algorithmic point of view. In this article we discuss about the processability of Lemke’s algorithm with respect to some selective matrix classes.
Jana, R.; Das, A. K.; and Sinha, S.
On Processability of Lemke’s Algorithm,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 13,
2, Article 31.
Available at: https://digitalcommons.pvamu.edu/aam/vol13/iss2/31