On Some Properties of $K$ type Block Matrices in the context of Complementarity Problem
Abstract
In this article we introduce $K$type block matrices which include two new classes of block matrices namely block triangular $K$matrices and hidden block triangular $K$matrices. We show that the solution of linear complementarity problem with $K$type block matrices can be obtained by solving a linear programming problem. We show that block triangular $K$matrices satisfy least element property. We prove that hidden block triangular $K$matrices are $Q_0$ and processable by Lemke's algorithm. The purpose of this article is to study properties of $K$type block matrices in the context of the solution of linear complementarity problem.
 Publication:

arXiv eprints
 Pub Date:
 September 2021
 arXiv:
 arXiv:2109.09549
 Bibcode:
 2021arXiv210909549D
 Keywords:

 Mathematics  Optimization and Control;
 90C33;
 90C51;
 15A39;
 15B99