The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are ___________.

Related MCQs

• A feasible solution to a linear programming problem _____.
• Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have assignments equal to___________.
• A feasible solution of an Linear Programming Problem that optimizes then the objective function is called _________
• A set of feasible solution to a Linear Programming Problem is ___________
• The transportation problem deals with the transportation of ________.
• The initial solution of a transportation problem can be obtained by applying any known method. How-ever, the only condition is that__________.
• One disadvantage of using North-West Corner Rule to find initial solution to the transportation problem is that_______.
• The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that____.
• For finding an optimum solution in transportation problem ____________ method is used.
• To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are___________.