"On Some Properties of K-type Block Matrices in the Context of Compleme" by A. Dutta and A. K. Das
 

On Some Properties of K-type Block Matrices in the Context of Complementarity Problem

Document Type

Conference Article

Publication Title

Springer Proceedings in Mathematics and Statistics

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 the least element property. We prove that hidden block triangular K-matrices are Q0 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.

First Page

143

Last Page

154

DOI

10.1007/978-981-19-9307-7_12

Publication Date

1-1-2022

Comments

Open Access, Green

This document is currently not available here.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Policy Citations: 1
    • Citation Indexes: 1
  • Usage
    • Abstract Views: 1
  • Captures
    • Readers: 2
see details

Share

COinS