If there is no non-negative replacement ratio in solving a Linear Programming Problem then the solution is ____.

Related MCQs

• If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.
• 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 a sllution which is sought to be improved, then the solution is_____.
• A feasible solution of an Linear Programming Problem that optimizes then the objective function is called _________
• While solving a linear programming problem in feasibility may be removed by _________.
• ____________ method is an alternative method of solving a Linear Programming Problem involving artificial variables
• A feasible solution to a linear programming problem _____.
• A set of feasible solution to a Linear Programming Problem is ___________
• Solution of a Linear Programming Problem when permitted to be infinitely large is called _________.
• An Linear Programming Problem have ____________ optimal solution