
doi: 10.1007/bf01582098
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.
Linear Complementarity Problems, Numerical mathematical programming methods, Analysis of algorithms and problem complexity, Cycling, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Linear Complementarity Problems, Numerical mathematical programming methods, Analysis of algorithms and problem complexity, Cycling, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 16 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
