A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
2017
EURO Journal on Computational Optimization
An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction. Basic steps bring a disjunctive set in regular form closer to its disjunctive normal form and, in turn, produce relaxations that are at least as tight. An open question is: What are guaranteed bounds on the improvement from a basic step? In this paper, using properties of a convex disjunctive program's hull reformulation and multipliers
doi:10.1007/s13675-017-0088-0
fatcat:viotmq3cwfclvgkdfoangvissm