Discussion
The number of non-negative variables in a basic feasible solution to a \(m \times n\) transportation problem is :
Answer: A
A basic feasible solution has \(m + n - 1\) basic variables.
A transportation problem with m sources and n destinations has \(m + n\) constraints (one per row total and one per column total). Because total supply equals total demand, one of these equations follows from the others, so only \(m + n - 1\) are independent, and a basic solution has that many basic variables, the allocated cells. A non-degenerate basic feasible solution has exactly \(m + n - 1\) positive allocations.
mn is the total number of cells, not the number in a basis. \(m + n\) ignores the redundant constraint, and \(m + n + 1\) has no basis at all.
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