Noun
Dantzig-Wolfe decomposition (countable and uncountable, plural Dantzig-Wolfe decompositions)
(computing theory) An algorithm for solving linear programming problems with special structure, relying on delayed column generation for improving the tractability of large-scale linear programs.