Final answer:
Minimum cost flow problems are a special type of linear programming problem that involve finding the optimal flow through a network while minimizing the total cost of the flow.
Step-by-step explanation:
Minimum cost flow problems can be considered as a special type of linear programming problem that falls under the category of network flow problems. These problems involve finding the optimal flow through a network while minimizing the total cost of the flow. They are often used in areas such as transportation and logistics.
For example, consider a distribution network where goods need to be transported from multiple sources to multiple destinations. The objective is to determine the optimal flow of goods through the network while minimizing the total cost of transportation.
Therefore, the statement that minimum cost flow problems are the special type of linear programming problem referred to as distribution-network problems is true.