engineering recuitment GATE ME 2023-24 Test Series Industrial Engineering Operations Research Linear Programming
A company manufactures products P and Q in quantities x1 and x2, respectively, using two resources. The following Linear Programming Problem (LPP) is formulated to maximize the profit Z.
Maximize Z = 3x1 + 2x2
subject to x1 + 2x2 ≤ 2 (for Resource 1)
2x1 + x2 ≤ 2 (for Resource 2)
and x1, x2 ≥ 0
The shadow price for Resource 2 is
1
0
2
2/3
3
1
4
4/3