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/13 masteredA primal program max{cTx:Ax≤b, x≥0} has 5 constraints and 3 variables. How many variables does its dual have? Review the explanation for this topic →Type your answer — press Enter to checkEnter your answer