The non basic variables are called ___________.

Related MCQs

• 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 one or more variable vanish then a basic solution to the system is called ____________.
• When we solve a system of simultaneous linear equations by using two-phase method, the values of decision variables will be _______.
• If the constraint of an Linear Programming Problem has an in equation of less than or equal to type, the variables to be added are__________
• If the primal problem has n constraints and m variables then the number of constraints in the dual problem is __________.
• ____________ method is an alternative method of solving a Linear Programming Problem involving artificial variables
• The coefficient of slack\surplus variables in the objective function are always assumed to be ______.
• If an artificial variable is present in the basic variable column of optimal simplex table, then the 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___________.
• If there is no non-negative replacement ratio in solving a Linear Programming Problem then the solution is ____.