If there are m sources and n destinations in a transportation matrix, the total number of basic variables in a basic feasible solution is
A
m
No worries! Weāve got your back. Try BYJUāS free classes today!
B
m + n
No worries! Weāve got your back. Try BYJUāS free classes today!
C
m + n + 1
No worries! Weāve got your back. Try BYJUāS free classes today!
D
m + n - 1
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
Open in App
Solution
The correct option is D m + n - 1 Basic feasible solution: For a maximum transportation problem, if the total number of allocation is exactly equal to m + n - 1, then the solution is called the basic feasible solution.
Points to Remember
Non-degenerate basic feasible solutions: For a maximum transportation problem, feasible solution is not degenerate, if the following two conditions are satisfied;
Total number of allocation is exactly equal to m + n - 1
These m + n - 1 allocations must be at independent position.