The linear complementrity problem with exact order matrices

Mohan, S. R. ; Parthasarathy, T. ; Sridhar, R. (1994) The linear complementrity problem with exact order matrices Mathematics of Operations Research, 19 (3). pp. 618-644. ISSN 0364-765X

Full text not available from this repository.

Official URL: http://mor.journal.informs.org/content/19/3/618.ab...

Related URL: http://dx.doi.org/10.1287/moor.19.3.618

Abstract

A real n by n matrix A is called an N(P)-matrix of exact order k if the principal minors of A of order 1 through (n + k) are negative (positive) and (n - k + 1) through n are positive (negative). In this paper the properties of exact order 1 and 2 matrices are investigated, using the linear complementarity problem LCP(q, A) for each q ∈ Rn. A complete characterization of the class of exact order 1 based on the number of solutions to the LCP(q, A) for each q ∈ Rn is presented. In the last season we consider the problem of computing a solution to the LCP(q, A) when A is a matrix of exact order 1 or 2.

Item Type:Article
Source:Copyright of this article belongs to Informs.
Keywords:Linear Complementarity Problem; Exact Order Matrices of Order 1, Order 2; Completely Mixed Games Minimax Value; Q-matrix
ID Code:90940
Deposited On:15 May 2012 09:57
Last Modified:15 May 2012 09:57

Repository Staff Only: item control page