Picture of a sphere with binary code

Making Strathclyde research discoverable to the world...

The Strathprints institutional repository is a digital archive of University of Strathclyde research outputs. It exposes Strathclyde's world leading Open Access research to many of the world's leading resource discovery tools, and from there onto the screens of researchers around the world.

Explore Strathclyde Open Access research content

EP theorem for dual linear complementarity problem

Illes, T. and Nagy, M. and Terlaky, T. (2009) EP theorem for dual linear complementarity problem. Journal of Optimization Theory and Applications, 140 (2). pp. 233-238. ISSN 0022-3239

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

The linear complementarity problem (LCP) belongs to the class of -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.