A
A. K. Das
Researcher at Indian Statistical Institute
Publications - 45
Citations - 507
A. K. Das is an academic researcher from Indian Statistical Institute. The author has contributed to research in topics: Linear complementarity problem & Complementarity theory. The author has an hindex of 8, co-authored 41 publications receiving 180 citations.
Papers
More filters
Journal ArticleDOI
More on positive subdefinite matrices and the linear complementarity problem
TL;DR: In this article, the authors considered positive subdefinite matrices (PSBD) and showed that linear complementarity problems with PSBD matrices of rank ⩾ 2 are processable by Lemke's algorithm and that a PSBD matrix of rank 2 belongs to the class of sufficient matrices introduced by R.W. Cottle et al.
Journal ArticleDOI
On the classes of fully copositive and fully semimonotone matrices
TL;DR: In this paper, the authors considered the class C 0 f of fully copositive matrices and the class E 0f of fully semimonotone matrices, and they showed that the columns of these matrices with positive diagonal entries are column sufficient.
BookDOI
Mathematical programming and game theory for decision making
TL;DR: In this article, the authors present an analysis of sets of Constraints, Traveling Salesman Problem, and Tolerance-Based Algorithms for linear programs with Totally Unimodular Coefficient Matrix Interior Point Method for Convex Quadratic Programming Analysis of Sets of CONstraints.
Book ChapterDOI
Finiteness of Criss-Cross Method in Complementarity Problem
A. K. Das,R. Jana,Deepmala +2 more
TL;DR: 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.
Journal ArticleDOI
On almost type classes of matrices with Q-property
S. K. Neogy,A. K. Das +1 more
TL;DR: In this article, Ravindran et al. introduced a new matrix class almost (a subclass of almost N 0-matrices which are obtained as a limit of a sequence of almost n 0 -matrices) and obtained a sufficient condition for this class to hold Q-property.