The criss-cross method is able to compute solution of a linear complementarity problem in finite steps in case of some new matrix classes and a numerical illustration is presented to show a comparison between criss -cross method and Lemke's algorithm with respect to number of iterations before finding a solution.Expand

This paper proposes an iterative and descent type interior point method to compute solution of linear complementarity problem LCP(q, A) given that A is real square matrix and q is a real vector and shows that the proposed algorithm converges to the solution of LCP(_, A), where A belongs to GPSBD class.Expand

This paper is devoted to the study of a generalized Mittag-Leffler function operator introduced by Shukla and Prajapati (J. Math. Anal. Appl. 336:797-811, 2007). Laplace and Mellin transforms of this… Expand

The proposed algorithm can process LCP (q, A) in polynomial time under some assumptions and is observed to be able to process the solution aspects of linear complementarity problem with hidden Z-matrix.Expand

It is shown that for a non-degenerate feasible basis, linear complementarity problem with hidden Z-matrix has unique non- Degenerate solution under some assumptions.Expand

In this paper, we consider a class of transportation problems which arises in sample surveys and other areas of statistics. The associated cost matrices of these transportation problems are of… Expand

In this article, we introduce the class of semimonotone star ($E_0^s$) matrices. We establish the importance of the class of $E_0^s$-matrices in the context of complementarity theory. We show that… Expand

Abstract We revisit the class of column competent matrices and study some matrix theoretic properties of this class. The local w-uniqueness of the solutions to the linear complementarity problem can… Expand

In this article we study linear complementarity problem with hidden Z-matrix. We extend the results of Fiedler and Pták for the linear system in complementarity problem using game theoretic approach.… Expand