ANSWERS ALL CORRECT
A travel agent is attempting to find the fastest combination of transportation options to
allow a customer to travel from one city to another. What type of network optimization
problem is this?
Minimum-Cost Flow Problem
Maximum-Cost Flow Problem
Minimum Flow Problem
Maximum Flow Problem
Shortest Path Problem - Answer-Shortest Path Problem
Which of the following can be formulated as a linear programming problem?
I. Minimum-Cost Flow Problem
II. Maximum Flow Problem
III. Shortest Path Problem
I only
II only
III only
I, II, and III
None of the answer choices can be formulated as a linear programming problem -
Answer-I, II, and III
Shortest path problem formulation can be applied to which of the following?
I. Finding the combination of travel modes which minimizes distance travelled
II. Finding the combination of travel modes which minimizes travel time
III. Finding the combination of travel modes which minimizes travel cost
I only
II only
III only
I, II, and III
None of the answer choices is correct - Answer-I, II, and III
In the following network diagram, how many supply nodes are present?
AB--C---DEF
1
2