Technical Note—The Use of Cuts in Complementary Programming
From MaRDI portal
Publication:5183263
DOI10.1287/opre.21.1.353zbMath0274.90025OpenAlexW2071772344MaRDI QIDQ5183263
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
Related Items
A pivoting algorithm for linear programming with linear complementarity constraints, A polyhedral study of the semi-continuous knapsack problem, Branch-and-cut for complementarity-constrained optimization, A study of the difference-of-convex approach for solving linear programs with complementarity constraints, Solving linear programs with complementarity constraints using branch-and-cut, Convexification techniques for linear complementarity constraints, On cutting planes for cardinality-constrained linear programs, An enhanced logical benders approach for linear programs with complementarity constraints