Triangularity of the basis in linear programs for material requirements planning

DOI10.1016/0167-6377(88)90057-0zbMath0669.90073OpenAlexW2059312477MaRDI QIDQ1119175

James K. Ho, William A. McKenney

Publication date: 1988

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90057-0

zbMATH Keywords

Dantzig-Wolfe decompositionparallel processingtriangular basismaterial requirements planninginventory holding

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Theory of operating systems (68N25)

Related Items

Decomposition of linear programs using parallel computation

Cites Work

• Decomposition of linear programs using parallel computation
• Extreme points of Leontief substitution systems
• Optimal Solution of a Dynamic Leontief Model with Substitution
• Decomposition Principle for Linear Programs
• 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
• A Primal Simplex Approach to Pure Processing Networks
• Recent advances in the decomposition approach to linear programming
• Optimal Multi-Level Lot Sizing for Requirements Planning Systems