Multiple Choice
Which of the following is an application of a shortest path problem?
I. Minimize total distance traveled.
II. Minimize total flow through a network.
III. Minimize total cost of a sequence of activities.
IV. Minimize total time of a sequence of activities
A) I and II only
B) I, II, and III only.
C) IV only
D) I, II, III, and IV
E) I, III, and IV only.
Correct Answer:

Verified
Correct Answer:
Verified
Q51: The figure below shows the nodes (A-I)
Q52: A minimum cost flow problem is a
Q53: Which of the following will have negative
Q54: In a maximum flow problem, the source
Q55: The figure below shows the nodes (A-I)
Q57: What is the objective of a maximum
Q58: A manufacturing firm has three plants
Q59: Which of the following can be used
Q60: A manufacturing firm has four plants
Q61: In a feasible minimum cost flow problem,