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_____.

Related MCQs

• If an artificial variable is present in the basic variable column of optimal simplex table, then the solution is___________.
• If any value in XB column of final simplex table is negative, then the solution is___.
• During iteration while moving from one solution to the next, degeneracy may occur when______________.
• If all aij values in the entering variable column of the simplex table are negative, then _____.
• If one or more variable vanish then a basic solution to the system is called ____________.
• The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are ___________.
• 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____.
• In the optimal simplex table, Zj-Cj=0 value indicates _____________.
• Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have assignments equal to___________.