EP Theorem for Dual Linear Complementarity Problems

T. Illés (), M. Nagy () and T. Terlaky ()
Additional contact information
T. Illés: Strathclyde University
M. Nagy: Eötvös Lorànd University of Science
T. Terlaky: School of Computational Engineering and Science, McMaster University

Journal of Optimization Theory and Applications, 2009, vol. 140, issue 2, No 3, 233-238

Abstract: Abstract The linear complementarity problem (LCP) belongs to the class of $\mathbb{NP}$ -hard problems. Therefore, we cannot expect a polynomial time solution method for LCPs without requiring some special property of the matrix of the problem. We show that the dual LCP can be solved in polynomial time if the matrix is row sufficient; moreover, in this case, all feasible solutions are complementary. Furthermore, we present an existentially polytime (EP) theorem for the dual LCP with arbitrary matrix.

Keywords: Linear complementarity problem; Dual LCP; Row sufficient matrix; ℘*-matrix; EP theorem (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-008-9440-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:joptap:v:140:y:2009:i:2:d:10.1007_s10957-008-9440-0

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-008-9440-0

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().