Solving more linear complementarity problems with Murty's Bard-type algorithm

DOI10.1007/BF00940447zbMath0792.90081OpenAlexW2087486471MaRDI QIDQ1321349

K. L. Dunlap, Michael M. Kostreva

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940447

zbMATH Keywords

linear complementarity problemdigraphs\(Q\)-matricesprincipal submatrix\(P\)-matrixMurty's algorithm

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• NP-completeness of the linear complementarity problem
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• Sets of Generalized Complementarity Problems and P-Matrices
• Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
• Recent Results On Complementarity Models For Engineering And Economics

This page was built for publication: Solving more linear complementarity problems with Murty's Bard-type algorithm