ABSTRACT This nal project discusses the maximum ow using the Ford-Fulkerson al- gorithm and linear programming. Maximum ow problem solving using the Ford-Fulkerson algorithm is limited to capacity constraints, while solving using linear programming can be used for various kinds of constraints. At the end of the discussion, a maximum ow problem is given which is solved by using both …