If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.

Related MCQs

• 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 ____________.
• If the primal problem has n constraints and m variables then the number of constraints in the dual problem is __________.
• 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 ___________.
• The right hand side constant of a constraint in a primal problem appears in the corresponding dual as___________.
• If the primal has an unbound objective function value then the other problem has ___________ .
• Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has _________.
• If there is no non-negative replacement ratio in solving a Linear Programming Problem then the solution is ____.
• A feasible solution of an Linear Programming Problem that optimizes then the objective function is called _________
• An Linear Programming Problem have ____________ optimal solution