Abstract
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.
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.
No Figures found in article.
Dr. Dewan Ferdous Wahid. 2012. “. Global Journal of Science Frontier Research – F: Mathematics & Decision GJSFR-F Volume 12 (GJSFR Volume 12 Issue F10): .
Crossref Journal DOI 10.17406/GJSFR
Print ISSN 0975-5896
e-ISSN 2249-4626
A Comparative Study of the Effeect of Promotion on Employee
The Problem Managing Bicycling Mobility in Latin American Cities: Ciclovias
Impact of Capillarity-Induced Rising Damp on the Energy Performance of
Liver Disease Prediction using Machine Learning Algorithms Home > GJCST
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.
