A class of polynomially solvable linear complementarity problems

DOI10.1007/S10107-005-0671-7MaRDI QIDQ2492703zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A class of linear complementarity problems solvable in polynomial time
• A polynomial-time algorithm for a class of linear complementarity problems
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• A new polynomial time method for a linear complementarity problem
• A note on solvability of a class of linear complementarity problems
• PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
• Linear complementarity problems solvable as linear programs
• On the Solution Sets of Linear Complementarity Problems
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• On linear problems with complementarity constraints

Cites work

• A boundary property of semimartingale reflecting Brownian motions
• A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Bimatrix Equilibrium Points and Mathematical Programming
• Completely- matrices
• CP-rays in simplicial cones
• Hidden Z-matrices with positive principal minors
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 3332062 (Why is no real title available?)
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• Monotone solutions of the parametric linear complementarity problem
• NP-completeness of the linear complementarity problem
• On the simplex method and a class of linear complementarity problems

Cited in

(10)

• A new polynomial time method for a linear complementarity problem
• Co-NP-completeness of some matrix classification problems
• Linear complementarity model predictive control with limited iterations for box-constrained problems
• A representation of the solution set of a class of linear complementarity problems
• Some LCPs solvable in strongly polynomial time with Lemke's algorithm
• An interior-point algorithm based on general kernel function for monotone linear complementarity problem
• scientific article; zbMATH DE number 7313887 (Why is no real title available?)
• A polynomially solvable case of optimal linear extension problem of a poset
• A note on solvability of a class of linear complementarity problems
• Generalizations of the hidden Minkowski property

This page was built for publication: A class of polynomially solvable linear complementarity problems

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