Application of disjunctive programming to the linear complementarity problem
From MaRDI portal
Publication:5184695
DOI10.1002/nav.3800310408zbMath0559.90088OpenAlexW1969805773MaRDI QIDQ5184695
Publication date: 1984
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800310408
linear complementarity problemdisjunctive programmingtest problemscutting plane methodComputational experiencecopositive plus
Related Items
Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, An experimental investigation of enumerative methods for the linear complementarity problem, Quadratic programming problems and related linear complementarity problems, Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\), Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, Convexification techniques for linear complementarity constraints, Enumeration approach for linear complementarity problems based on a reformulation-linearization technique, Enhanced intersection cutting-plane approach for linear complementarity problems, Stability in disjunctive optimization II:continuity of the feasible and optimal set, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, Basic-set algorithm for a generalized linear complementarity problem, A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
Cites Work