Dantzig-Wolfe decomposition
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.
Noun
Dantzig-Wolfe decomposition (countable and uncountable, plural Dantzig-Wolfe decompositions)
- An algorithm for solving linear programming problems with special structure, relying on delayed column generation for improving the tractability of large-scale linear programs.
Forms of Dantzig-Wolfe decomposition
| plural | Dantzig-Wolfe decompositions |
|---|
Origin of Dantzig-Wolfe decomposition
Originally developed by George Dantzig and Philip Wolfe, who published in 1960.
Questions about Dantzig-Wolfe decomposition
- What does Dantzig-Wolfe decomposition mean?
- Dantzig-Wolfe decomposition means an algorithm for solving linear programming problems with special structure, relying on delayed column generation for improving the tractability of large-scale linear programs.
- What part of speech is Dantzig-Wolfe decomposition?
- Dantzig-Wolfe decomposition is a noun.
- What is the plural of Dantzig-Wolfe decomposition?
- The plural of Dantzig-Wolfe decomposition is Dantzig-Wolfe decompositions.
Words near Dantzig-Wolfe decomposition in the dictionary
Source and license
Adapted from Wiktionary: Dantzig-Wolfe decomposition (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Dantzig-Wolfe decomposition.” Word.ws, https://word.ws/dantzig-wolfe_decomposition. Based on Wiktionary, CC BY-SA 4.0.
