Multiple Choice
The figure below shows the possible routes from city A to city M as well as the cost (in dollars) of a trip between each pair of cities (note that if no arc joins two cities it is not possible to travel non-stop between those two cities) . A traveler wishes to find the lowest cost option to travel from city A to city M. Which nodes are the origin and destination for this problem?
A) Node A is the origin, Node I is the destination.
B) Node A is the origin, Node M is the destination.
C) Node B is the origin, Node I is the destination.
D) Node B is the destination, Node I is the origin.
E) Node A is the destination, Node I is the origin.
Correct Answer:

Verified
Correct Answer:
Verified
Q14: The figure below shows the possible routes
Q15: A manufacturing firm has three plants
Q16: Which of the following is not an
Q17: In a maximum flow problem, flow is
Q18: A network model showing the geographical layout
Q20: The figure below shows the possible routes
Q21: A minimum cost flow problem will have
Q22: The figure below shows the nodes (A
Q23: When reformulating a shortest path problem as
Q24: A transportation problem is just a minimum