Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Industrial Engineering Operations Research Linear Programming
Which of the following statements is/are CORRECT for LPP?
(i) The feasible region for an LP problem is always a polyhedral convex set.
(ii) The feasible region for an LP problem can be a convex or concave set.
(iii) The optimal solution of an objective function (if it exists) must occur at a vertex of the feasible region.
(iv) In the case of the unbounded feasible region if M is the maximum value at all the corner points, then M is the maximum value of the objective function z = ax + by if the open half plane is determined by ax + by > M has no point in common with the feasible region.
1
(ii), (iii) and (iv)
2
(i), (iii) and (iv)
3
(i) and (iii)
4
(i) and (iv)