If there is no non-negative replacement ratio in a sllution which is sought to be improved, then the solution is_____.

Related MCQs

• If there is no non-negative replacement ratio in solving a Linear Programming Problem then the solution is ____.
• The group replacement policy in suitable for identical low cost items which are likely to_________.
• The problem of replacement is felt when job performing units fail_____.
• 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_____.
• If any value in XB column of final simplex table is negative, then the solution is___.
• If an artificial variable is present in the basic variable column of optimal simplex table, then the solution is___________.
• If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.
• A feasible solution of an Linear Programming Problem that optimizes then the objective function is called _________
• If one or more variable vanish then a basic solution to the system is called ____________.
• Which of the following methods is used to verify the optimality of the current solution of the transportation problem_________.