A feasible solution of an Linear Programming Problem that optimizes then the objective function is called _________

Related MCQs

• If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.
• A feasible solution to a linear programming problem _____.
• A set of feasible solution to a Linear Programming Problem is ___________
• 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 ____.
• Solution of a Linear Programming Problem when permitted to be infinitely large is called _________.
• An Linear Programming Problem have ____________ optimal solution
• Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have assignments equal to___________.
• The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are ___________.
• If the given Linear Programming Problem is in its canonical form then primal-dual pair is ___________.