Description: In this paper we pose and answer two questions about solutions of the linear complementarity problem (LCP). The first question is concerned with the conditions on a square matrix M which guarantee that for every vector q, the solutions of LCP (q,M) are identical to the Karush-Kuhn-Tucker points of the natural quadratic program associated with (q,M). In answering this question we introduce the class of ''row sufficient'' matrices. The transpose of such a matrix is what we call ''column sufficient.'' The latter matrices turn out to furnish the answer to our second question which asks for the conditions on M under which the solution set of (q,M) is convex for every q. In addition to these two main results, we discuss the connections of these two new matrix classes with other well-known matrix classes in linear complementarity theory. 23 refs.
Date: November 1, 1987
Creator: Ye, Yinyu
Item Type: Refine your search to only Report
Partner: UNT Libraries Government Documents Department