Dantzig-Wolfe decomposition

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

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

Noun[edit]

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

  1. (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.