The figure below shows the nodes (A-I) and capacities (labelled on arcs in TB/s) of a computer network. The firm would like to know how much information 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 TB/s) of a computer network. The firm would like to know how much information 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 identifying the maximum amount of flow that can be transmitted from node A to node I in a network is a classic example of a Maximum Flow Problem. This involves determining the maximum amount of flow that can be sent from a source node to a sink node in a network, subject to capacity constraints on the arcs. The solution to this problem can be obtained using various algorithms like Ford-Fulkerson algorithm or Edmonds-Karp algorithm.

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