Gate ME-2010 Question Paper With Solutions

Q 25. Simplex method of solving linear programming problem uses

(A) all the points in the feasible region

(B) only the corner points of the feasible region

(C) intermediate points within the infeasible region

(D) only the interior points in the feasible region

Answer: (D)

Explanation:

Gate ME-2010 Question Paper With Solutions

Learn More:   Gate EC-2013 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here