Abstract
Flow maximization is a fundamental problem in mathematics; there are several algorithms available to solve this problem, but these algorithms have some limitations. This paper presents the flow maximization problem as a Linear Programming Problem (L.P.P.). The solution given by L.P.P. formulation of the problem and provided by Ford Fulkerson algorithm is same. This paper also compares the single path flow and k-splitting of the flow and suggests that k-splitting of flow is better than single path flow.
Recommended Citation
Dimri, Sushil C. and Ram, Mangey
(2018).
Flow Maximization Problem as Linear Programming Problem with Capacity Constraints,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 13,
Iss.
1, Article 33.
Available at:
https://digitalcommons.pvamu.edu/aam/vol13/iss1/33