Question: The linear programming formulation of a maximal flow problem with 20 nodes and 100 arcs will have (check all that applies) (a) 221 constraints (assuming
The linear programming formulation of a maximal flow problem with 20 nodes and 100 arcs will have (check all that applies) (a) 221 constraints (assuming the dummy arc from the destination to the origin is used and including non-negativity). (b) 101 constraints (assuming the dummy arc from the destination to the origin is used and excluding non-negativity). (c) 120 constraints (assuming the dummy arc from the destination to the origin is used and including non-negativity). (d) 120 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
