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 type of network optimization problem is used to solve this problem?
A) Maximum-Cost Flow problem
B) Average-Cost Flow problem
C) Maximum Flow Problem
D) Minimum Flow Problem
E) Shortest Path Problem

Question

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 type of network optimization problem is used to solve this problem?
A) Maximum-Cost Flow problem 
B) Average-Cost Flow problem 
C) Maximum Flow Problem 
D) Minimum Flow Problem 
E) Shortest Path Problem

Quizplus · Accepted Answer

The problem described here is a classic example of the shortest path problem, where the objective is to find the lowest cost path between two nodes in a graph. In this case, the graph represents the network of cities and the costs represent the transportation costs between them. Therefore, the correct answer is E, the Shortest Path problem.

The Figure Below Shows the Possible Routes from City a to City