A feasible solution is called a basic feasible solution if the number of non‐negative allocations is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Related MCQs

• A feasible solution is called a basic feasible solution if the number of non‐negative allocations is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• A non – degenerate basic feasible solution is the basic feasible solution which has exactly m positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• A non – degenerate basic feasible solution is the basic feasible solution which has exactly m positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• When the total of allocations of a transportation problem match with supply and demand values, the solution is called solution.
• Optimal solution is a feasible solution (not necessarily basic ) which minimizes the ‐‐‐‐‐‐‐‐‐‐
• State which of the two statements is correct (i) the cells in the transportation table can be classified in to occupied cells and unoccupied cells (ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost
• Optimal solution is a feasible solution (not necessarily basic ) which minimizes the ‐‐‐‐‐‐‐‐‐‐
• State which of the two statements is correct (i) the cells in the transportation table can be classified in to occupied cells and unoccupied cells (ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost
• If M + N – 1 = Number of allocations in transportation, it means . (Where ‘M’ is number of rows and ‘N’ is number of columns)
• When the allocations of a transportation problem satisfy the rim condition (m + n – 1) the solution is called