Cutting-planes for programs with disjunctive constraints

DOI10.1007/BF00934290zbMATH Open0238.90044OpenAlexW2149830595MaRDI QIDQ2553385FDOQ2553385

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3332061 (Why is no real title available?)
• Convexity Cuts and Cut Search
• Hypercylindrically Deduced Cuts in Zero-One Integer Programs
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming

Cited in

(12)

• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• Two mixed integer programming formulations arising in manufacturing management
• A note on duality in disjunctive programming
• Stability in disjunctive optimization II:continuity of the feasible and optimal set
• Facet inequalities from simple disjunctions in cutting plane theory
• Polyhedral annexation in mixed integer and combinatorial programming
• 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
• A converse for disjunctive constraints
• Degeneracy removal in cutting plane methods for disjoint bilinear programming
• Disjunctive programming: Properties of the convex hull of feasible points

This page was built for publication: Cutting-planes for programs with disjunctive constraints

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