A

Admin • 36.93K Points
Coach 

Q. Any solution to a LPP which satisfies the non‐ negativity restrictions of the LPP is called its ‐‐‐‐‐‐‐‐

(A) Unbounded solution
(B) Optimal solution
(C) Feasible solution
(D) Both A and B

Correct Answer - Option(C)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related Posts

Q. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are called mathematical models

Q. Linear programming has been successfully applied in ‐‐‐‐‐‐‐‐‐‐‐

Q. After determining every basic cell with in this cycle, adjustment is obtained as minimum value in basic cells . this is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Q. What is being considered as one of the most versatile management tools?

Q. A minimization problem can be converted into a maximization problem by changing the sign of coefficients in the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Q. Any column or raw of a simplex table is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Q. A feasible solution is called a basic feasible solution if the number of non‐negative allocations is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Q. ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are the representation of reality

Q. If in a LPP , the solution of a variable can be made infinity large without violating the constraints, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Q. To find the optimal solution, we apply ‐‐‐‐‐‐‐‐‐‐

View All Posts