Research
A Solution Procedure for Minimum Convex-Cost Network Flow Problems
Article
September 3, 2012
This paper presents a procedure to solve Minimum Convex-Cost Network Flow Problems (MC-CNFP). This solution algorithm is constructed on the concepts of Network Simplex Method (NSM) for minimum cost network flow problem, Convex Simplex Method (CSM) of Zangwill, the decomposition of convex simplex method and non-linear transformation problem.
