[2][3][4][5][6][7] Dantzig–Wolfe decomposition relies on delayed column generation for improving the tractability of large-scale linear programs.
For most linear programs solved via the revised simplex algorithm, at each step, most columns (variables) are not in the basis.
After identifying the required form, the original problem is reformulated into a master program and n subprograms.
There are general, parallel, and fast implementations available as open-source software, including some provided by JuMP and the GNU Linear Programming Kit.
Another design choice for implementation involves columns that exit the basis at each iteration of the algorithm.