Journal article
Even more with the Lemke complementarity algorithm
Mathematical programming, Vol.34(2), pp.239-242
03/01/1986
DOI: 10.1007/BF01580589
Abstract
This note presents a new termination result for the Lemke linear complementarity algorithm that unifies two previous results. Special cases include linear complementarity problems satisfying the Evers condition, and those whoseM matrix is copositive-plus.
Details
- Title: Subtitle
- Even more with the Lemke complementarity algorithm
- Creators
- Philip C. Jones - Northwestern University
- Resource Type
- Journal article
- Publication Details
- Mathematical programming, Vol.34(2), pp.239-242
- DOI
- 10.1007/BF01580589
- ISSN
- 0025-5610
- eISSN
- 1436-4646
- Number of pages
- 4
- Language
- English
- Date published
- 03/01/1986
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963118202771
Metrics
1 Record Views