On the solution and complexity of a generalized linear complementarity problem
- 1 June 1994
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 4 (4) , 415-424
- https://doi.org/10.1007/bf01099266
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity ProblemMathematics of Operations Research, 1993
- A class of linear complementarity problems solvable in polynomial timeLinear Algebra and its Applications, 1991
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- 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
- Sufficient matrices and the linear complementarity problemLinear Algebra and its Applications, 1989
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methodsJournal of Optimization Theory and Applications, 1988
- Maximization of A convex quadratic function under linear constraintsMathematical Programming, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972