Minimal Cost Flow in Processing Networks: A Primal Approach

摘要

Processing network problems are considered. Procedures in the primal simplex algorithm for LP-problems with simple upper bounds is discussed. Hall's theorem is applied to generalized processing network problems. Mathematical models for the minimal cost flow problem in pure or generalized processing networks are given. Procedures developed can be applied in solving real-world industrial or managerial problems. Expected computational results are discussed.