Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs
From MaRDI portal
Publication:2942683
DOI10.1287/ijoc.2014.0610zbMath1321.90089OpenAlexW2012078768MaRDI QIDQ2942683
Francisco Trespalacios, Ignacio E. Grossmann
Publication date: 11 September 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2014.0610
Related Items (5)
Cutting Plane Algorithm for Convex Generalized Disjunctive Programs ⋮ Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming ⋮ Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques ⋮ An interleaved depth-first search method for the linear optimization problem with disjunctive constraints ⋮ Between steps: intermediate relaxations between big-M and convex hull formulations
Uses Software
This page was built for publication: Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs