Minimum Convex-Cost Network Flow Problems

The Minimum Convex-Cost Network Flow Problems (MC-CNFP) is a class of network flow problem, with nonlinear (convex) cost function, has an important role in operations research. The convexity of the cost (or objective) function arise in various ways such as strictly convex, mixed linear and strictly convex, piece-wise linear convex, pseudo-convex etc. A number of solution methods developed in the last few decades on the view of different type convexity of cost function. In this dissertation we have present a Proposed Solution Algorithm for MC-CNFP, which can deals with convex cost function. This solution algorithm is constructed on the basis of Network Simplex Method for minimum cost network flow problem with linear cost function, Zangwill s Convex Simplex Method (Zangwill I. W., 1967) and it s extension for quadratic programming problem (Swarup K., 1977) and the decomposition of the convex simplex method for large scale convex programming problems (Hsia W. S., 1973, 1974, 1975) and Non-Linear Transportation Problems (Terefe K., 2007).

Autorentext

D.F. Wahid obtained his MS in Mathematics from University of Chittagong in 2011. Currently he is working as Lecturer(Math) in the Dept. of Natural Science, Stamford University Bangladesh.Prof. Dr.Ganesh Chandra Ray,Dept.of Mathematics,CU, presently working as Professor in Asian University for Women. Dr.Ray obtained Ph.D from Moscow(Russia) in 1985