The transportation problem of m resources and n destinations can be written as Linear Programming Problem with :
MH SET - 2023, SET Exam - 2023,
Answer: D
It has mn decision variables and (m + n) constraints.
Let \(x_{ij}\) be the quantity shipped from source i to destination j. There is one such variable for every source-destination pair, so \(m \times n\) variables.
Each source has a supply constraint (what it ships cannot exceed, or must equal, its supply), giving m constraints, and each destination has a demand constraint, giving n more: \(m + n\) in all, plus non-negativity.
The other options confuse the two counts: mn constraints would mean one per route, and \(m + n\) variables would mean one per location rather than per route.
Please log in or register to report this question.