Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound
Lists
Only you see this
Abstract
Highlights•A Lagrangean relaxation of the hull-reformulation of linear GDPs is presented.•The proposed Lagrangean relaxation always yields 0–1 values to the binary variables.•The proposed Lagrangean relaxation can be solved by solving many small LPs in parallel.•The Lagrangean relaxation is incorporated into a disjunctive branch and bound as primal heuristic.•Computational results show that the proposed modified disjunctive branch and bound performs better than other alternatives of the algorithm.
BibTeX
@article{trespalacios2016lagrangean,
author = {Francisco Trespalacios and Ignacio E. Grossmann},
title = {{Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound}},
journal = {Eur. J. Oper. Res.},
year = {2016},
doi = {10.1016/j.ejor.2016.02.048},
}Loading related content...