A class of linear complementarity problems solvable in polynomial time (Q1174838)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A class of linear complementarity problems solvable in polynomial time |
scientific article; zbMATH DE number 9510
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of linear complementarity problems solvable in polynomial time |
scientific article; zbMATH DE number 9510 |
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
