Cutting-Planes for Complementarity Constraints
From MaRDI portal
Publication:4178799
DOI10.1137/0316005zbMATH Open0395.90076OpenAlexW2053234120MaRDI QIDQ4178799FDOQ4178799
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
Cited In (18)
- Convexification techniques for linear complementarity constraints
- Solving linear programs with complementarity constraints using branch-and-cut
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
- Extensions of a theorem of Balas
- New classes of facets for complementarity knapsack problems
- A finitely convergent procedure for facial disjunctive programs
- 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
- Implied constraints and a unified theory of duality in linear and nonlinear programming
- Relaxations and cutting planes for linear programs with complementarity constraints
- Duality in disjunctive linear fractional programming
- Convexification techniques for linear complementarity constraints
- Branch-and-cut for complementarity-constrained optimization
- A strong duality theorem for the minimum of a family of convex programs
- An enhanced logical benders approach for linear programs with complementarity constraints
- A polyhedral study of the semi-continuous knapsack problem
- A finite cutting plane method for facial disjunctive programs
- Algorithms for linear programming with linear complementarity constraints
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)
