Triangularity of the basis in linear programs for material requirements planning
In material requirements planning (MRP) one seeks a production schedule minimizing the costs of producing and inventory holding of several products, either assembly parts of other products or finished goods. It is assumed that the assembly structure is fixed and the demand of finished goods is known over a finite horizon. This problem may be stated as a linear program, but with seemingly prohibitive dimensions. For the case of a single finished product and no limits on production and storage, it is shown that any basis of the corresponding LP is triangular, hence easy to solve. The authors suggest to exploit this property in a decomposition approach for the general problem in combination with parallel processing.
- Material allocation in MRP with tardiness penalties
- scientific article; zbMATH DE number 3845341
- Solution methods for material requirement planning with lot-size dependent lead times
- scientific article; zbMATH DE number 3856814
- A Method for Determining Feasible Master Production Schedules for Material Requirements Planning Systems
- A Primal Simplex Approach to Pure Processing Networks
- Decomposition of linear programs using parallel computation
- Decomposition Principle for Linear Programs
- Extreme points of Leontief substitution systems
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems
- Optimal Multi-Level Lot Sizing for Requirements Planning Systems
- Optimal Solution of a Dynamic Leontief Model with Substitution
- Recent advances in the decomposition approach to linear programming
This page was built for publication: Triangularity of the basis in linear programs for material requirements planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1119175)
