On a Variable Dimension Algorithm for the Linear Complementarity Problem

Ludo Van der Heyden

No 689, Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University

Abstract: In an earlier paper we presented a variable dimension algorithm for solving the linear complementarity problem (LCP). We now extend the class of LCP's that can be solved by this algorithm to include LCP's with copositive plus coefficient matrices. The extension, inspired by Lemke [1965], is obtained by introducing an artificial dimension and by applying the variable dimension algorithm to the enlarged LCP.

Pages: 12 pages
Date: 1984-01
Note: CFP 511.
References: Add references at CitEc
Citations:

Published in Mathematical Programming (1980), 19: 328-346

Downloads: (external link)
https://cowles.yale.edu/sites/default/files/files/pub/d06/d0689.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cwl:cwldpp:689

Ordering information: This working paper can be ordered from
Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA
The price is None.

Access Statistics for this paper

More papers in Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University Yale University, Box 208281, New Haven, CT 06520-8281 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Brittany Ladd ().