Combined approach to solve linear complementarity problem

Abstract

In this paper, we present a new approach in order to solve the linear complementary problem noted (LCP). We have combined the ideas of Lemke's method and its variants taking advantage of the benefits of each approach in order to improve the convergence of these algorithms. Numerical simulations and comparative results of the new approach are provided. Since the quadratic convex program and linear program can be written as (LCP), so it can be resolved thanks to our new approach.

Keywords

• linear complementarity problem
• Lemke algorithm
• quadratic convex program
• linear program
• pivot