The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are:

Related MCQs

• Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution:
• Initial feasible solution to a transportation Problem can be found out by .........................
• A feasible solution to a linear programming problem
• If the feasible region of a linear programming problem is empty, the solution is ....................
• When at least one of the basic variables is zero, then the basic feasible solution to a Linear Programming Problem is said to be ..............................
• The initial solution of a transportation problem can be obtained by applying any known method. But the only condition is
• When total supply is equal to total demand in a transportation problem , the problem is said to be
• Operations Research does not give perfect solution to a problem, but it helps to improve the ......................... of the solution.
• An optimal solution is considered as the ................... among the feasible solutions.
• Matrix Minima Method to find initial feasible solution to a TP is also called .......................