Facet inequalities from simple disjunctions in cutting plane theory

DOI10.1007/BF01582164zbMath0582.90077OpenAlexW2047386570MaRDI QIDQ3707764

Suvrajeet Sen, Hanif D. Sherali

Publication date: 1986

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

dualitydisjunctive programmingcutting planescut generationextreme points of reverse polarsfacets of the convex hull of disjunctive sets

Mathematics Subject Classification ID

Integer programming (90C10) Polytopes and polyhedra (52Bxx)

Related Items

Relaxations for probabilistically constrained programs with discrete random variables, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, On the implementation and strengthening of intersection cuts for QCQPs, On the implementation and strengthening of intersection cuts for QCQPs, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, Stability in disjunctive optimization II:continuity of the feasible and optimal set

Cites Work

• Unnamed Item
• Optimization with disjunctive constraints
• Cutting-planes for programs with disjunctive constraints
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
• A Cutting-Plane Game for Facial Disjunctive Programs
• On the generation of deep disjunctive cutting planes
• Polyhedral annexation in mixed integer and combinatorial programming
• Disjunctive Programming
• Polyhedral convexity cuts and negative edge extensions