Linear complementarity problems solvable as linear programs

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 b...

Full description

Bibliographic Details
Published in:Journal of Numerical Analysis and Approximation Theory
Main Author: Zakia Kebbiche
Format: Article
Language:English
Published: Publishing House of the Romanian Academy 2018-12-01
Subjects:
Online Access:https://www.ictp.acad.ro/jnaat/journal/article/view/1156
Description
Summary: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.
ISSN:2457-6794
2501-059X