Technical Note—The Use of Cuts in Complementary Programming

DOI10.1287/OPRE.21.1.353zbMATH Open0274.90025OpenAlexW2071772344MaRDI QIDQ5183263FDOQ5183263

Authors: Toshihide Ibaraki 

Publication date: 1973

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.21.1.353

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10)

Cited In (9)

• Solving linear programs with complementarity constraints using branch-and-cut
• A pivoting algorithm for linear programming with linear complementarity constraints
• A study of the difference-of-convex approach for solving linear programs with complementarity constraints
• Relaxations and cutting planes for linear programs with complementarity constraints
• Convexification techniques for linear complementarity constraints
• Branch-and-cut for complementarity-constrained optimization
• On cutting planes for cardinality-constrained linear programs
• An enhanced logical benders approach for linear programs with complementarity constraints
• A polyhedral study of the semi-continuous knapsack problem

This page was built for publication: Technical Note—The Use of Cuts in Complementary Programming

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