Digitale Medien
Springer
Mathematical programming
16 (1979), S. 127-130
ISSN:
1436-4646
Schlagwort(e):
Linear Complementarity Problem
;
Lemke's Algorithm
;
Cycling
;
Degeneracy
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Informatik
,
Mathematik
Notizen:
Abstract A bound for the minimum length of a cycle in Lemke's Algorithm is derived. An example illustrates that this bound is sharp, and that the fewest number of variables is seven.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01582098
Permalink
Bibliothek |
Standort |
Signatur |
Band/Heft/Jahr |
Verfügbarkeit |