Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Industrial Engineering Operations Research Linear Programming
For the Linear Programming Problem,
Minimize Z = 13x + 6.5y, subject to constraints
2x + 3y ≥ 25
5x + y ≥ 23
x, y ≥ 0
Then this Linear programming problem is having?
1
Unbounded feasible region but bounded solution
2
Bounded feasible region with 3 corner points
3
Unique solution
4
No solution