Dantzig-Wolfe Decomposition : a Lower Bound

Given the current dual multipliers (coupling constraints) (convexity constraint),

a lower bound can be computed at each iteration, as follows:

Current solution value

+ minimum

reduced cost column

Previous slide

Next slide

Back to first slide

View graphic version