Bounds for the solution set of linear complementarity problems

DOI10.1016/0166-218X(87)90028-XzbMath0611.90094MaRDI QIDQ1087474

Panos M. Pardalos, J. Ben Rosen

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

nonconvex problemlower and upper boundsLinear Complementaritysolution norm

Mathematics Subject Classification ID

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

Related Items

The integer linear complementarity problem, Linear complementarity problems solvable by integer programming, The numerical range theory and boundedness of solutions of the complementarity problem, The numerical range theory and boundedness of solutions of the complementarity problem, Enumeration approach for linear complementarity problems based on a reformulation-linearization technique, Enhanced intersection cutting-plane approach for linear complementarity problems, Note on solving linear complementarity problems as jointly constrained bilinear programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complementarity problem: Theory and methods of solution
• Bounds for error in the solution set of a perturbed linear program
• Simple computable bounds for solutions of linear complementarity problems and linear programs
• Global Optimization Approach to the Linear Complementarity Problem
• Some perturbation results for the Linear Complementarity Problem
• Note on a Fundamental Theorem in Quadratic Programming