Fabrication and assembly operations, Part IV: Linear programming in production planning

By a Dantzig and Wolfe decomposition, followed by an application of a column generating technique, a problem originally calling for simplex computations on an (I + 5KT)(I + 5KT) matrix (and for the investigation of scalar products with columns as numerous as schedules) is reduced to a problem calling for simplex computations on a (5KT + 1)(5KT + I) matrix and for a string of I associated dynamic programming calculations.