Question: The linear programming formulation of a shortest path problem with 20 nodes and 120 arcs will have (check all that applies) (a) 140 constraints (excluding
The linear programming formulation of a shortest path problem with 20 nodes and 120 arcs will have (check all that applies)
(a) 140 constraints (excluding binary constraints).
(b) 120 constraints (including binary constraints).
(c) 2400 constraints (including binary constraints).
(d) 20 constraints (excluding binary constraints).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
