The figure below shows the nodes (A-I) and capacities (labelled on arcs in packages/day) of a shipping network. The firm would like to know how many packages per day can flow from node A to node I. Which type of network optimization problem is used to solve this problem?
A) Maximum-Cost Flow problem
B) Minimum-Cost Flow problem
C) Maximum Flow Problem
D) Minimum Flow Problem
E) Shortest Path Problem

Question

The figure below shows the nodes (A-I) and capacities (labelled on arcs in packages/day) of a shipping network. The firm would like to know how many packages per day can flow from node A to node I.  Which type of network optimization problem is used to solve this problem?
A) Maximum-Cost Flow problem 
B) Minimum-Cost Flow problem 
C) Maximum Flow Problem 
D) Minimum Flow Problem 
E) Shortest Path Problem

Quizplus · Accepted Answer

The problem of determining the maximum amount of packages that can flow from node A to node I is a classic example of a Maximum Flow Problem in network optimization. The objective is to maximize the flow (i.e., the number of packages) from the source node (A) to the sink node (I) subject to the capacity constraints on the arcs. Therefore, the correct choice is C, Maximum Flow Problem.

The Figure Below Shows the Nodes (A-I) and Capacities (Labelled