On the redundancy of cutting planes for linear complementarity problems

DOI10.1080/02331938508843048zbMath0588.90089OpenAlexW1968760718MaRDI QIDQ3716850

Elsayed Abdel Aziz, Jürgen Guddat, Heinz Bernau

Publication date: 1985

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938508843048

zbMATH Keywords

convexitylinear complementarity problemssimplex techniquedisjunctive cutting planesredundancy of cutting planes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (1)

Quadratic programming problems and related linear complementarity problems

Cites Work

• Nonconvex Quadratic Programming via Generalized Polars
• On the generation of deep disjunctive cutting planes
• Unnamed Item
• Unnamed Item

This page was built for publication: On the redundancy of cutting planes for linear complementarity problems