A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix

DOI10.1016/S0167-6377(96)00034-XzbMath0892.90171OpenAlexW1492437819MaRDI QIDQ1374383

Abdelaziz Foul

Publication date: 4 December 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(96)00034-x

zbMATH Keywords

linear complementaritymatrix classesTucker point

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\)
• Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
• Reducing horizontal linear complementarity problems
• On characterizing linear complementarity problems as linear programs
• Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
• Characterizations of bounded solutions of linear complementarity problems
• A Partial Characterization of a Class of Matrices Defined by Solutions to the Linear Complementarity Problem
• Linear complementarity problems solvable by A single linear program
• A note on an open problem in linear complementarity
• Characterization of linear complementarity problems as linear programs
• On solving linear complementarity problems as linear programs
• A Least-Element Theory of Solving Linear Complementarity Problems as Linear Programs
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Some classes of matrices in linear complementarity theory
• A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP

This page was built for publication: A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix