Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Industrial Engineering Operations Research Linear Programming
The corner points of a feasible region in a linear programming problem are (8, 0), (7, 2), (5, 3), (3, 6), and (0, 9). What is the relation between the maximum value (M) and the minimum value (m) of the objective function Z = 2x + 12y.
1
27M = 4m
2
27M + 4m = 0
3
4M = 27m
4
4M + 27m = 0