Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Industrial Engineering Operations Research Linear Programming
Consider the following linear programming (LP):
Max. Z = 2x1 + 3x2
Such that 2x1 + x2 ≤ 4
x1 + 2x2 ≤ 5
x1, x2 ≥ 0
The optimum value of the LP is
1
23
2
9.5
3
13
4
8