Discussion
The transportation problem of m resources and n destinations can be written as Linear Programming Problem with :
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.
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development