Column Generation · Linear Programming · Decomposition
Dantzig‑Wolfe
Decomposition
Solve large-scale linear programmes with block-angular structure by decomposing them into a master problem and independent sub-problems, communicating through column generation.
Explore the site
-
History
Discover the origins of Dantzig-Wolfe Decomposition, its relationship to the Simplex method, and its landmark industrial applications.
-
Lesson
Work through a structured technical lesson covering the master problem, sub-problems, column generation, and convergence — with full KaTeX notation.
-
Examples
Explore three worked examples from the literature — cutting stock, multi-commodity flow, and crew scheduling — with explicit iteration traces.
-
Solver
Run Dantzig-Wolfe decomposition on your own problem directly in your browser. No server required — the solver runs via Pyodide (Python on WebAssembly).