A class of polynomially solvable linear complementarity problems

DOI10.1007/s10107-005-0671-7zbMath1111.90108MaRDI QIDQ2492703

Teresa H. Chu

Publication date: 14 June 2006

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/47904

zbMATH Keywords

linear complementarity problem

Mathematics Subject Classification ID

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

Related Items

Generalizations of the hidden Minkowski property, Interior-point algorithm based on general kernel function for monotone linear complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• CP-rays in simplicial cones
• NP-completeness of the linear complementarity problem
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• On the simplex method and a class of linear complementarity problems
• Hidden Z-matrices with positive principal minors
• A boundary property of semimartingale reflecting Brownian motions
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model
• Completely- matrices
• Bimatrix Equilibrium Points and Mathematical Programming
• Monotone solutions of the parametric linear complementarity problem