Question: A minimum cost flow problem with 35 nodes and 50 arcs (each with upper and lower bounds) will have (check all that applies) (a) none
A minimum cost flow problem with 35 nodes and 50 arcs (each with upper and lower bounds) will have (check all that applies)
(a) none of the other options is correct.
(b) 85 constraints (including non-negativity).
(c) 1750 constraints (including non-negativity).
(d) 35 constraints (including non-negativity).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
