The transportation problem is a good example of a pure integer programming problem.

Question

Quizplus · Accepted Answer

The transportation problem typically involves determining the optimal way to transport a certain quantity of goods from multiple sources to multiple destinations, while minimizing total transportation costs. This problem can be formulated as a pure integer programming problem, where the decision variables represent the amount of goods transported from each source to each destination, and must take on integer values.

The Transportation Problem Is a Good Example of a Pure