Abstract
In this paper, we present a theoretical and numerical study of linear complementary problems solvable as linear programs.
We give several examples of linear complementarity problems which can be solved as linear programs using linear programming appraoches. Also, we propose two examples solved by the simplex and Karmarkar's method, while the most widely know method for solving linear complementarity problems "the complementarity pivoting algorithm due to Lemke" has failed to find a solution.
Publisher
Academia Romana Filiala Cluj