The linear programming formulation of a transportation problem, in general, has demand constraints which are either $\geq$ or $=$ type.

Name: The linear programming formulation of a transportation problem, in general, has demand constraints which are either $\geq$ or $=$ type.
Brand: Quizplus
Rating: 4.9 (36 reviews)

Question

Quizplus · Accepted Answer

Demand constraints in a transportation problem can be either greater than or equal to (≥) or equal to (=) type, depending on whether the demand at a destination is fixed or flexible.

The Linear Programming Formulation of a Transportation Problem, in General ≥\geq≥

The Linear Programming Formulation of a Transportation Problem, in General $\geq$