Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound

DOI10.1016/j.ejor.2016.02.048zbMath1346.90632OpenAlexW2291122407MaRDI QIDQ323168

Francisco Trespalacios, Ignacio E. Grossmann

Publication date: 7 October 2016

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

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

zbMATH Keywords

Lagrangean relaxationdisjunctive programmingGDPMILP

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Scalable branching on dual decomposition of stochastic mixed-integer programming problems, Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hierarchy of relaxations for linear generalized disjunctive programming
• A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
• Integrated methods for optimization
• An algorithm for disjunctive programs
• Disjunctive programming: Properties of the convex hull of feasible points
• Dual decomposition in stochastic integer programming
• Generalized convex disjunctive programming: Nonlinear convex hull relaxation
• Lagrangean relaxation. (With comments and rejoinder).
• Lagrangian relaxation based algorithm for trigeneration planning with storages
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms