Cutting-Planes for Complementarity Constraints

DOI10.1137/0316005MaRDI QIDQ4178799zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(18)

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

This page was built for publication: Cutting-Planes for Complementarity Constraints

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