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

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

Question

Quizplus · Accepted Answer

The linear programming formulation of a transportation problem typically has supply constraints of the $\leq$ or $=$ type, ensuring that the amount shipped from each supply point does not exceed its available supply.

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

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