Maximum Flow Minimum Cost Problem In A Network

Maximum ow minimum cost(MFMC) problem combines sending as much ow as possible fromrnthe source node to the sink node with minimum cost.Here the attributes for the network are therncapacity,ow and cost per unit ow of an arc which varies linearly with the amount of ow.Thernproblem has two special problems namely the shortest path problem and maximum ow problemrnfor which we set all the capacities and cost are set to be zero respectively.Solving maximum owrnminimum cost involves two steps;_nding the maximum ow and then _nd the minimum costrnusing the feasible ow as an input.

Get Full Work

Report copyright infringement or plagiarism