Abstract:
This article discusses the
ow maximization using Ford Fulkerson algorithm and
linear programming. Using the Ford-Fulkerson algorithm, rst the paths are found
so that they can be passed. If there are no more paths that can be streamed, then
the
ow on the network is optimal. At the end of the discussion, a case is given
to solve the maximum
ow problem using both methods. Furthermore, the two
methods produces the same solution. This article is a review of Sushil dan Mangey
[Applications and Applied Mathematics, 13 (2018), 508-515]