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 + 2x2subject to x1 + 2x2 ≤ 2 (for Resource 1)2x1 + x2 ≤ 2 (for Resource 2)and x1, x2 ≥ 0The shadow price for Resource 2 is

A company manufactures products P and Q in quantities x1 and x2, respe

1.	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 + 2x2subject to x1 + 2x2 ≤ 2 (for Resource 1)2x1 + x2 ≤ 2 (for Resource 2)and x1, x2 ≥ 0The shadow price for Resource 2 is
A.	0
B.	2/3
C.	1
D.	4/3
Answer» E.