Solveeit Logo

Question

Industrial Engineering Question on Linear Programming

Consider the following linear programming problem with two decision variables x1x_1 and x2x_2. There are three constraints involving resources R1,R2R_1, R_2 and R3R_3 as indicated.
Maximize Z=6x1+5x2Z = 6x_1+5x_2
Subject to
2x1+5x2402x_1+5x_2\leq 40 R1R_1
2x1+x2222x_1 + x_2 \leq 22 R2R_2
x1+x213x_1 + x_2 \leq 13 R3R_3
X10, X20X_1 \geq0, \ X_2 \geq 0
The optimal solution of the problem is: x1=9x_1 =9 and x2=4x_2=4
For which one of the following options, the shadow price of the resource(s) will have non-zero value(s)?

A

R1, R2 and R3

B

R1 and R2

C

R2 and R3

D

R1 only

Answer

R2 and R3

Explanation

Solution

The correct option is (C): R2 and R3.