Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Industrial Engineering Operations Research Linear Programming
Consider an LPP given as
Max Z = 2x1 - x2 + 2x3
Subject to the constraints
2x1 + x2 ≤ 10
x1 + 2x2 - 2x3 ≤ 20
x1 + 2x3 ≤ 5
x1, x2, x3 ≥ 0
What shall be the solution of the LPP after applying first iteration of the Simplex Method?
1
x1 = 5/2, x2 = 0, x3 = 0, Z = 5
2
x1 = 0, x2 = 0, x3 = 5/2, Z = 5
3
x1 = 0, x2 = 5/2, x3 = 0, Z = -5/2
4
x1 = 0, x2 = 0, x3 = 10, Z = 20