As long as all its supplies and demands have integer values,any transportation problem with feasible solutions is guaranteed to have an optimal solution with integer values for all its decision variables

Question

Quizplus · Accepted Answer

This statement is true. The transportation problem is a linear programming problem with integer constraints, and it is a special case of the linear integer programming problem. The transportation problem always has an integer solution because all supplies and demands are integer values. Therefore, any feasible solution of the transportation problem is guaranteed to have an optimal solution with integer values for all its decision variables.

As Long as All Its Supplies and Demands Have Integer