Flows and Linear Programming Duality

Max-flow min-cut, the algorithms that realise it, and the linear programming duality that explains every min–max theorem here.0/80 mastered

1 / 80

In a network with arcs out of the source

s\to a

and

s\to b

and no arcs into

s

, a flow satisfies

f(s\to a)=3

and

f(s\to b)=2

. What is

|f|

Your answer

#12623