On the application of the ABS algorithm to linear programming and linear complementarity
In this paper, we discuss the application of the ABS algorithm to the simplex method, the dual simplex method, the linear complementary problem. We consider the ABS formulation of the stopping criterion, the search direction, the minimal rule to determine the vectors entering and leaving the basis matrix and the updating of the Abaffian matrix after a basis vector exchange. The Lemke algorithm for the LCP problem is reformulated in terms of the ABS procedure.
abs algorithm linear complementarity simplex method dual simplex method implicit lx algorithm