On solving linear complementarity problems with sufficient matrices by Lemke`s method
Conference
·
OSTI ID:35921
- Stanford Univ., CA (United States)
It is known that Lemke`s Method will process a degenerate linear complementarity problem when the matrix used in defining the problem belongs to the class of {open_quotes}sufficient matrices{close_quotes}. The same can be said for the Principal Pivoting Method (of Dantzig and Cottle). For the latter algorithm there is a least-index pivoting rule that resolves the problems of degeneracy; that is, it ensures the finiteness of the procedure by preventing cycling. This talk will address the technical problems one encounters in attempting to establish the comparable result for Lemke`s Method.
- OSTI ID:
- 35921
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Least-index resolution of degeneracy in linear complementarity problems with sufficient matrices
The equivalence of Dantzig's self-dual parametric algorithm for linear programs to Lemke's algorithm for linear complementarity problems applied to linear programs: Technical report
On the vertical block generalized linear complementarity problems
Technical Report
·
Fri Jun 01 00:00:00 EDT 1990
·
OSTI ID:6745357
The equivalence of Dantzig's self-dual parametric algorithm for linear programs to Lemke's algorithm for linear complementarity problems applied to linear programs: Technical report
Technical Report
·
Fri May 01 00:00:00 EDT 1987
·
OSTI ID:6593295
On the vertical block generalized linear complementarity problems
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36292