A class of linear complementarity problems solvable in polynomial time (Q1174838): Difference between revisions
From MaRDI portal
Latest revision as of 10:26, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of linear complementarity problems solvable in polynomial time |
scientific article |
Statements
A class of linear complementarity problems solvable in polynomial time (English)
0 references
25 June 1992
0 references
The authors show that a class of linear complementarity problems is solvable in polynomial time using a potential reduction algorithm.
0 references
polynomial complexity
0 references
quadratic programming
0 references
linear complementarity problems
0 references
potential reduction algorithm
0 references
0 references
0 references
0 references
