Dantzig-Wolfe vs Lagrangian Decomposition Relaxation

Essentially utilized for Linear Programs

Relatively difficult to implement

Slow convergence

Rarely implemented

Essentially utilized for Integer Programs

Easy to implement with subgradient adjustment for multipliers ?

No stopping rule !

? 6% of OR papers

Previous slide

Next slide

Back to first slide

View graphic version