A hierarchy of relaxations for linear generalized disjunctive programming

DOI10.1016/j.ejor.2011.07.018zbMath1266.90132MaRDI QIDQ421708

Ignacio E. Grossmann, Nicolas W. Sawaya

Publication date: 14 May 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.07.018

zbMATH Keywords

integer programming; disjunctive programming; hull relaxation

Mathematics Subject Classification ID

90C10: Integer programming

Related Items

Three algorithms for graph locally harmonious colouring, A disjunctive model to analyze and redefine the logistic of replenishing goods of retailing stores, Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound, A hierarchy of relaxations for nonlinear convex generalized disjunctive programming, Structured learning modulo theories, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems, Solving linear optimization over arithmetic constraint formula, Global optimization of disjunctive programs, Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming, An interleaved depth-first search method for the linear optimization problem with disjunctive constraints, \textsc{OptiMathSAT}: a tool for optimization modulo theories, Mixed Integer Linear Programming Formulation Techniques, Optimization Modulo Theories with Linear Rational Costs, Cutting Plane Algorithm for Convex Generalized Disjunctive Programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representability in mixed integer programming. I: Characterization results
• Optimization with disjunctive constraints
• Facial disjunctive programs and sequences of cutting-planes
• Logic-based decision support. Mixed integer model formulation
• Disjunctive programming: Properties of the convex hull of feasible points
• Exact algorithms for the guillotine strip cutting/packing problem.
• Generalized convex disjunctive programming: Nonlinear convex hull relaxation
• Sequential convexification in reverse convex and disjunctive programming
• Review of nonlinear mixed-integer and disjunctive programming techniques
• A branch-and-cut method for 0-1 mixed convex programming
• Convex programming for disjunctive convex optimization
• Modelling with integer variables
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Disjunctive Programming