On the solution of NP-hard linear complementarity problems
- 1 June 2002
- journal article
- Published by Springer Nature in TOP
- Vol. 10 (1) , 125-145
- https://doi.org/10.1007/bf02578944
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Solution of a General Linear Complementarity Problem Using Smooth Optimization and Its Application to Bilinear Programming and LCPApplied Mathematics & Optimization, 2001
- A primal-dual trust-region algorithm for non-convex nonlinear programmingMathematical Programming, 2000
- Deterministic Global OptimizationPublished by Springer Nature ,2000
- On the Solution of the Monotone and Nonmonotone Linear Complementarity Problem by an Infeasible Interior-Point AlgorithmPublished by Springer Nature ,1996
- On the solution and complexity of a generalized linear complementarity problemJournal of Global Optimization, 1994
- A computational analysis of LCP methods for bilinear and concave quadratic programmingComputers & Operations Research, 1991
- NP-Completeness of the linear complementarity problemJournal of Optimization Theory and Applications, 1989
- An experimental investigation of enumerative methods for the linear complementarity problemComputers & Operations Research, 1988
- An implicit enumeration procedure for the general linear complementarity problemPublished by Springer Nature ,1987
- Two-Level Linear ProgrammingManagement Science, 1984