Network Flow - Minimum flow in a network
Imagine you have the following graph (in red are the minimum capacities):



The $(s,t)$-path with the lowest flow demand needs $1$ unit of flow, but the minimum flow is $4$. And the $(s,t)$-path with minimum sums of capacities has a sum of $2$, so this also doesn't work.