Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Industrial Engineering Operations Research Linear Programming
Use Dual Simplex Method to solve the following problem:
Maximize z = -2x1 -3x2
subject to:
x1 + x2 ≥ 2
2x1 + x2 ≤ 10
x1 + x2 ≤ 8
x1, x2 ≥ 0
1
x1 = 6, x2 = 2 and z = -18
2
x1 = 2, x2 = 6 and z = -22
3
x1 = 2, x2 = 0 and z = -4
4
x1 = 0, x2 = 2 and z = -6