On hidden Z-matrix and interior point algorithm

R. Jana (), A. K. Das () and A. Dutta ()
Additional contact information
R. Jana: Indian Statistical Institute
A. K. Das: Indian Statistical Institute
A. Dutta: Jadavpur University

OPSEARCH, 2019, vol. 56, issue 4, No 2, 1108-1116

Abstract: Abstract We propose an interior point method to compute solution of linear complementarity problem LCP (q, A) given that A is a real square hidden Z-matrix (generalization of Z-matrix) and q is a real vector. The class of hidden Z-matrix is important in the context of mathematical programming and game theory. We study the solution aspects of linear complementarity problem with $$A \in$$ A ∈ hidden Z-matrix. We observe that our proposed algorithm can process LCP (q, A) in polynomial time under some assumptions. Two numerical examples are illustrated to support our result.

Keywords: Z-matrix; Hidden Z-matrix; Simplex method; Interior point algorithm; Linear complementarity problem; 90C33; 90C51 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s12597-019-00412-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:opsear:v:56:y:2019:i:4:d:10.1007_s12597-019-00412-0

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-019-00412-0

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().