Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Mathematics Linear Programmig Problem Optimal Feasible Solution
Consider the following Linear Programming problem:
Maximise Z = -x1 + 2x2
subject to the constraints
x1 - x2 ≤ -1,
-0.5x1 + x2 ≤ 2,
x1, x2 ≥ 0.
Then the above problem has:
1
no optimal solution
2
unique optimal solutions Max Z = 2 for x1 = 0, x2 = 1
3
multiple optimal solutions Max Z = 4 for x1 = 0, x2 = 2 and x1 = 2, x2 = 3
4
unique optimal solution Max Z = 4 for x1 = 0, x2 = 2