The coefficient of slack\surplus variables in the objective function are always assumed to be ______.

Related MCQs

• The coefficient of an artificial variable in the objective function of penalty method are always assumed to be _____.
• A feasible solution of an Linear Programming Problem that optimizes then the objective function is called _________
• If the primal has an unbound objective function value then the other problem has ___________ .
• The calling population is assumed to be infinite when______.
• 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 __________.
• The non basic variables are called ___________.
• ____________ method is an alternative method of solving a Linear Programming Problem involving artificial variables
• The assignment problem is always a ________matrix.