A converse for disjunctive constraints

DOI10.1007/BF00933212zbMath0358.90036OpenAlexW2062809736MaRDI QIDQ1238749

C. E. Blair, Robert G. Jeroslow

Publication date: 1978

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

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

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Linear inequalities of matrices (15A39)

Related Items

Representability in mixed integer programming. I: Characterization results, A simplification for some disjunctive formulations, Facial disjunctive programs and sequences of cutting-planes, A finitely convergent procedure for facial disjunctive programs, Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights, Two mixed integer programming formulations arising in manufacturing management, Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints, Stability in disjunctive optimization II:continuity of the feasible and optimal set

Cites Work

• Strengthening cuts for mixed integer programs
• Cutting-planes for programs with disjunctive constraints
• Polyhedral annexation in mixed integer and combinatorial programming
• Trivial integer programs unsolvable by branch-and-bound
• Convex Analysis
• Concave Programming Applied to a Special Class of 0-1 Integer Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item