Some problems require minimum flow on certain edges. Edge must carry at least flow and at most flow. Convert the problem: subtract from the capacity and add to a demand at and supply at .
Then solve the modified max flow problem. If a feasible flow exists, you can recover it from the converted solution. This technique is advanced but comes up in problems like circulation and scheduling with constraints.