Lemke's algorithm

Lemke's algorithm is a mathematical method used to find a solution to a class of problems known as linear complementarity problems (LCPs). An LCP involves finding a vector \( z \) such that: 1. \( Mz + q \geq 0 \) 2. \( z \geq 0 \) 3.