On hidden Z-matrix and interior point algorithm

Article Type

Research Article

Publication Title

OPSEARCH

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∈ 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.

First Page

1108

Last Page

1116

DOI

10.1007/s12597-019-00412-0

Publication Date

12-1-2019

This document is currently not available here.

Share

COinS