On solving a larger subclass of linear complementarity problems by Lemke's method

DOI10.1007/S13226-025-00817-2MaRDI QIDQ6937213zbMATH OpenFDO

Authors Sajal Ghosh, Gambheer Singh, Deepayan Sarkar, S. K. Neogy

Publication date 27 August 2025

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S13226-025-00817-2

zbMATH Keywords

\(\mathbf{L}\)-matrixartificial LCP matrixLemke's algorithmlinear complementarity problem

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites work

• A new subclass of \(Q_0\)-matrix in linear complementarity theory
• Bimatrix Equilibrium Points and Mathematical Programming
• Characterization of linear complementarity problems as linear programs
• Cycling in linear complementarity problems
• Equilibrium Points of Bimatrix Games
• Even more with the Lemke complementarity algorithm
• Extensions of Lemke's algorithm for the linear complementarity problem
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• NP-completeness of the linear complementarity problem
• Orientation in Complementary Pivot Algorithms
• Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
• Some classes of matrices in linear complementarity theory
• The Linear Complementarity Problem
• The Linear Complementarity Problem

This page was built for publication: On solving a larger subclass of linear complementarity problems by Lemke's method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6937213)