Aqib Ismail, MuhammadJunaid Hassan, HTahir Anwar, Muhammad2018-01-242018-01-242017https://escholar.umt.edu.pk/handle/123456789/2580Supervised by: Mr. Amjad AliFor designing network graphs network provides most beneficial techniques because of their efficient mathematical structure that can be easily portrayed with graph. For manipulation minimum cost flow which is the important problem in optimal design generalized network with some constraint a case study of network simplex algorithm is described in this paper. Flow problem in the network can be communicate by the parameters that includes nodes, arcs and external flow for every node that is deliver to the demanded node. Optimization problem is to send flow from source to demand node in such a way total cost through the arc could be minimum and get the efficient path from all route that optimization for network flow is gain by the technique named as network simplex method.enDesigning networkNetwork simplex algorithmBS ThesisThesis