NP-completeness of the linear complementarity problem
From MaRDI portal
Publication:1095806
DOI10.1007/BF00940344zbMath0632.90072MaRDI QIDQ1095806
Publication date: 1989
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
90C05: Linear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Minimum-support solutions of polyhedral concave programs*, Linear complementarity problems and multiple objective programming, Gauss-Newton methods for the complementarity problem, Solving more linear complementarity problems with Murty's Bard-type algorithm, On the solution and complexity of a generalized linear complementarity problem, EP theorems and linear complementarity problems, The linear complementarity problem as a separable bilinear program, Existence theory and \(Q\)-matrix characterization for the generalized linear complementarity problem