If one or more variable vanish then a basic solution to the system is called ____________.

Related MCQs

• If an artificial variable is present in the basic variable column of optimal simplex table, then the solution is___________.
• At any iteration of the usual simplex method, if there is at least one basic variable in the basis at zero level and all the index numbers are non-negative, the current solution is_____.
• 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 _________
• If any value in XB column of final simplex table is negative, then the solution is___.
• If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.
• If there is no non-negative replacement ratio in solving a Linear Programming Problem then the solution is ____.
• If there is no non-negative replacement ratio in a sllution which is sought to be improved, then the solution is_____.
• If all aij values in the entering variable column of the simplex table are negative, then _____.
• One disadvantage of using North-West Corner Rule to find initial solution to the transportation problem is that_______.