Question: The linear programming formulation of a maximal flow problem with 10 nodes and 35 arcs will have (check all that applies) (c) 80 constraints (assuming
The linear programming formulation of a maximal flow problem with 10 nodes and 35 arcs will have (check all that applies)
(c) 80 constraints (assuming the dummy arc from the destination to the origin is used and including non-negativity). (a) 360 constraints (assuming the dummy arc from the destination to the origin is used and including non-negativity). (b) 45 constraints (assuming the dummy arc from the destination to the origin is used and excluding non-negativity). (d) 350 constraints (assuming the dummy arc from the destination to the origin is used and excluding non-negativity).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
