On cone orderings and the linear complementarity problem

DOI10.1016/0024-3795(78)90077-0zbMath0416.90072OpenAlexW2019798620MaRDI QIDQ754772

Jong-Shi Pang

Publication date: 1978

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(78)90077-0

zbMATH Keywords

linear complementarity problempolyhedral setscone orderingsleast elementsZ-matrices

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Linear inequalities of matrices (15A39) Polytopes and polyhedra (52Bxx)

Related Items

On the convergence of a basic iterative method for the implicit complementarity problem, Complementary irreducibilityS– matrices with connections to solutions of the linear complementarity problem, Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of a basic iterative method for the implicit complementarity problem
• Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
• Extreme points of Leontief substitution systems
• Existence theory for generalized nonlinear complementarity problems
• Generalized complementarity problem
• Optimal Solution of a Dynamic Leontief Model with Substitution
• On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
• Characterizations of bounded solutions of linear complementarity problems
• 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
• Polyhedral sets having a least element