Least-index resolution of degeneracy in linear complementarity problems with sufficient matrices
Technical Report
·
OSTI ID:6745357
This paper deals with the Principal Pivoting Method (PPM) for the Linear Complementarity Problem (LCP). It is shown here that when the matrix M of the LCP (q,M) is (row and column) sufficient, the incorporation of a least-index pivot selection rule in the PPM makes it a finite algorithm even when the LCP is degenerate. 10 refs.
- Research Organization:
- Stanford Univ., CA (USA). Systems Optimization Lab.
- Sponsoring Organization:
- DOD; DOE/ER; NSF
- DOE Contract Number:
- FG03-87ER25028
- OSTI ID:
- 6745357
- Report Number(s):
- SOL-90-9; ON: DE90014406; CNN: DMS-8913089 N00014-89-J-1659
- Country of Publication:
- United States
- Language:
- English
Similar Records
On solving linear complementarity problems with sufficient matrices by Lemke`s method
Eliminating columns in the simplex method for linear programming
The Principal Pivoting Method revisited
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35921
Eliminating columns in the simplex method for linear programming
Technical Report
·
Sat Oct 31 23:00:00 EST 1987
·
OSTI ID:5761063
The Principal Pivoting Method revisited
Technical Report
·
Fri Mar 31 23:00:00 EST 1989
·
OSTI ID:6125051