On testing nonnegativity of principal minors of Z -matrices using simplex method

DOI10.1007/S10479-021-04095-ZMaRDI QIDQ2171335zbMATH OpenOpenAlexFDO

Authors Dipti Dubey, S. K. Neogy

Publication date 8 September 2022

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-021-04095-z

zbMATH Keywords

\({\mathbf{M}} \)-matrix\({\mathbf{P}}_0 \)-matrix\({\mathbf{Z}} \)-matrixlinear complementarity problemsimplex method

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A polynomial-time test for M-matrices
• A stable test to check if a matrix is a nonsingular $M$-matrix
• scientific article; zbMATH DE number 2232794
• Algorithmic detection and construction of N-matrices
• scientific article; zbMATH DE number 1530329

Cites work

• A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices
• A polynomial-time test for M-matrices
• A recursive test for P-matrices
• An asymptotic approach for testing \(P_{0}\)-matrices
• scientific article; zbMATH DE number 3167494 (Why is no real title available?)
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 3212891 (Why is no real title available?)
• scientific article; zbMATH DE number 3275139 (Why is no real title available?)
• On the simplex method and a class of linear complementarity problems

Cited in

(2)

• An asymptotic approach for testing \(P_{0}\)-matrices
• A polynomial-time test for M-matrices

This page was built for publication: On testing nonnegativity of principal minors of \({\mathbf{Z}} \)-matrices using simplex method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2171335)