Cutting-planes for programs with disjunctive constraints

DOI10.1007/BF00934290zbMath0238.90044OpenAlexW2149830595MaRDI QIDQ2553385

Guillermo Owen

Publication date: 1973

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00934290

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30)

Related Items

Facet inequalities from simple disjunctions in cutting plane theory, Branch-and-cut for linear programs with overlapping SOS1 constraints, A strong duality theorem for the minimum of a family of convex programs, Strengthening cuts for mixed integer programs, Degeneracy removal in cutting plane methods for disjoint bilinear programming, Polyhedral annexation in mixed integer and combinatorial programming, A note on duality in disjunctive programming, A converse for disjunctive constraints, A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts, Two mixed integer programming formulations arising in manufacturing management, Disjunctive programming: Properties of the convex hull of feasible points, Stability in disjunctive optimization II:continuity of the feasible and optimal set

Cites Work

• Unnamed Item
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Hypercylindrically Deduced Cuts in Zero-One Integer Programs
• Convexity Cuts and Cut Search