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

Multiple Choice

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 =.