Max flow with restriction of individual flows
That constraint is linear, so the entire problem is an instance of linear programming, thus can be solved in polynomial time.  (I am assuming there is no restriction or requirement for integer flows.)

In general if you allow arbitrary constraints, the problem can become NP-hard.