An extension of the potential reduction algorithm for linear complementarity problems with some priority goals (Q1318200)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An extension of the potential reduction algorithm for linear complementarity problems with some priority goals |
scientific article |
Statements
An extension of the potential reduction algorithm for linear complementarity problems with some priority goals (English)
0 references
27 April 1994
0 references
The authors investigate linear complementarity problems with additional restrictions (priority goals), that some primal and dual variables must vanish. The potential reduction algorithm for linear programming and the corresponding unconstrained complementarity problem is generalized by modifying the potential function to get a polynomial time method. It is shown how the approach can be used to solve combined Phase I-II convex linear complementarity problems.
0 references
priority goals
0 references
liner complementarity problems
0 references
potential reduction algorithm
0 references
linear programming
0 references
unconstrained complementarity problem
0 references
polynomial time method
0 references
