Maximum flow problem
= Maximum flow problem
{title2=$\max_f|f|$}
{wiki}
= Maximum flow
{synonym}
The maximum flow problem maximises the <strength of a flow> from a source to a sink subject to <flow conservation> and <flow network edge capacities>. The <max-flow min-cut theorem> identifies the optimum with the least capacity of a <cut of a flow network>. A feasible <flow> and a <cut of a flow network> of equal value certify optimality without requiring a particular choice of <augmenting paths>.