Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1975-1979  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Cycling in linear complementarity problems (1979)
    Springer
    Mathematical programming 16 (1979), S. 127-130 
    Details
    ISSN: 1436-4646
    Keywords: Linear Complementarity Problem ; Lemke's Algorithm ; Cycling ; Degeneracy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: 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.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01582098
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...