Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Industrial Engineering Operations Research Linear Programming
Consider the following LPP:
Maximize z = 60X1 + 50X2
Subject to X1 + 2X2 ≤ 40,
3X1 + 2X2 ≤ 60
where, X1 and X2 ≥ 0
1
The LPP has a unique optimal solution
2
The LPP is infeasible
3
The LPP is unbound
4
The LPP has multiple optimal solutions