Cutting-Planes for Complementarity Constraints

DOI10.1137/0316005zbMath0395.90076OpenAlexW2053234120MaRDI QIDQ4178799

Robert G. Jeroslow

Publication date: 1978

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0316005

zbMATH Keywords

Cutting-PlanesGeneralized Linear Complementarity Problem

Mathematics Subject Classification ID

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

Related Items

Extensions of a theorem of Balas, A finite cutting plane method for facial disjunctive programs, A strong duality theorem for the minimum of a family of convex programs, Algorithms for linear programming with linear complementarity constraints, A polyhedral study of the semi-continuous knapsack problem, A finitely convergent procedure for facial disjunctive programs, Branch-and-cut for complementarity-constrained optimization, Convexification Techniques for Linear Complementarity Constraints, A study of the difference-of-convex approach for solving linear programs with complementarity constraints, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, Solving linear programs with complementarity constraints using branch-and-cut, Convexification techniques for linear complementarity constraints, An enhanced logical benders approach for linear programs with complementarity constraints, Duality in disjunctive linear fractional programming, Stability in disjunctive optimization II:continuity of the feasible and optimal set, Implied constraints and a unified theory of duality in linear and nonlinear programming