If any value in XB column of final simplex table is negative, then the solution is___.

Related MCQs

• If all aij values in the entering variable column of the simplex table are negative, then _____.
• 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_____.
• In the optimal simplex table, Zj-Cj=0 value indicates _____________.
• Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has _________.
• 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_____.
• The initial solution of a transportation problem can be obtained by applying any known method. How-ever, the only condition is that__________.
• The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that____.
• If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.