What is the maximum flow that can be achieved in a network with lower bounds on the flow of each edge?

In a network with lower bounds on the flow of each edge, the maximum flow that can be achieved is the total flow that satisfies all the lower bounds on the edges while maximizing the flow from the source to the sink.