Dantzig-Wolfe decomposition

noun

An algorithm for solving linear programming problems with special structure, relying on delayed column generation for improving the tractability of large-scale linear programs.

Meanings

nounDantzig-Wolfe decomposition (countable and uncountable, plural Dantzig-Wolfe decompositions)

plural Dantzig-Wolfe decompositions

  1. countableuncountablecomputerAn algorithm for solving linear programming problems with special structure, relying on delayed column generation for improving the tractability of large-scale linear programs.

Origin

Originally developed by George Dantzig and Philip Wolfe, who published in 1960.

Full word history & related roots →
Cite this entry
APA

Dantzig-Wolfe decomposition. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Dantzig-Wolfe%20decomposition

MLA

“Dantzig-Wolfe decomposition.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Dantzig-Wolfe%20decomposition. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Dantzig-Wolfe decomposition,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Dantzig-Wolfe%20decomposition.

Source: Dantzig-Wolfe decomposition on Wiktionary, CC BY-SA 4.0.