How to maximize flow while satisfying lower bounds on flow through individual edges ?

Revision en2, by Tanzir5, 2016-11-25 11:30:13

I was wondering if there is any way to solve the following problem:

" You are given a network graph. Every edge has two values associated with it: the upper bound of the amount of flow that CAN go through this edge and the lower bound of the amount of flow that MUST go through this edge. If there is no valid way to satisfy lower bound of all the edges, print "Unsolvable" . If there are multiple ways, maximize the amount of flow satisfying the lower bounds and upper bounds. You have to report the maximum amount and also the amount of flows through individual edges. "

No online judge has this problem ( at least none that I know of ). It's a random problem that came to my mind.

Tags maxflow, lower bound on maxflow

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English Tanzir5 2016-11-27 12:04:31 57
en2 English Tanzir5 2016-11-25 11:30:13 419
en1 English Tanzir5 2016-11-25 11:20:43 1103 Initial revision (published)