Triangularity of the basis in linear programs for material requirements planning

It is shown that the basis in a class of linear programs arising from material requirements planning can be triangularized. Thus allows for efficient adaptation of the Simplex Method similar to those for network problems. It also suggests that for finite-loading (i.e. capacitated) MRP, a decomposition approach exploiting both subproblem structure and parallel processing can be effective for handling complex problems in multiproduct, multistage, multiperiod production systems.