In the linear programming version of a true transportation model:
A)all constraints are $\ge$.
B)all constraints are $\le$.
C)some constraints are $\ge$ and some are $\le$.
D)all constraints are =.
E)some constraints are $\ge$ and some are =.

Question

Quizplus · Accepted Answer

In a true transportation model, the constraints are equalities because the total supply must equal the total demand, ensuring that all goods are transported without surplus or deficit.

In the Linear Programming Version of a True Transportation Model ≥\ge≥

In the Linear Programming Version of a True Transportation Model $\ge$