Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has _________.

Related MCQs

• If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.
• If there is no non-negative replacement ratio in solving a Linear Programming Problem then the solution is ____.
• An n-tuple of real numbers which satisfies the constraints of Linear Programming Problem is called ___________
• A feasible solution to a linear programming problem _____.
• A feasible solution of an Linear Programming Problem that optimizes then the objective function is called _________
• 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
• At any iteration of the usual simplex method, if there is at least one basic variable in the basis at zero level and all the index numbers are non-negative, the current solution is_____.
• If the constraints of an Linear Programming Problem has an in equation of greater than or equal to type, the variable to be added to are ___________