A new algorithm for the linear complementarity problem allowing for an arbitrary starting point
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University, Faculty of Economics and Business Administration in its series Research Memorandum with number 464.
Date of creation: 1990
Date of revision:
Contact details of provider:
Web page: http://www.tilburguniversity.edu/nl/over-tilburg-university/schools/economics-and-management/
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Dolf A.J.J. Talman & Ludo Van der Heyden, 1981.
"Algorithms for the Linear Complementarity Problem Which Allow an Arbitrary Starting Point,"
Cowles Foundation Discussion Papers
600, Cowles Foundation for Research in Economics, Yale University.
- Talman, A.J.J. & Heyden, L. van der, 1981. "Algorithms for the linear complementarity problem which allow an arbitrary starting point," Research Memorandum 99, Tilburg University, Faculty of Economics and Business Administration.
- Talman, A.J.J. & Van der Heyden, L., 1983. "Algorithms for the linear complementarity problem which allow an arbitrary starting point," Open Access publications from Tilburg University urn:nbn:nl:ui:12-153037, Tilburg University.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If references are entirely missing, you can add them using this form.