The maximum flow problem asks: what is the largest amount of flow you can send from source to sink while respecting all capacity constraints?
You need to find the flow assignment that maximizes the total flow leaving the source (which equals the total flow entering the sink). This problem appears in many contexts: network bandwidth, traffic routing, job assignments, and resource allocation.
The solution is always an integer if capacities are integers.