The right hand side constant of a constraint in a primal problem appears in the corresponding dual as___________.

Related MCQs

• If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.
• If all the constraints of the primal problem in equations are of type less than or equal to then the constraints in the dual problem is ___________.
• If the primal problem has n constraints and m variables then the number of constraints in the dual problem is __________.
• If the given Linear Programming Problem is in its canonical form then primal-dual pair is ___________.
• If the given Linear Programming Problem is in its standard form then primal-dual pair is ____________.
• For any primal problem and its dual______________.
• If the primal has an unbound objective function value then the other problem has ___________ .
• The dual of the dual is ____________.
• 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__________
• Maximization assignment problem is transformed into a minimization problem by_________.