The shadow price is the gain in the objective for one more unit of the resource. If part of the resource is left over (the constraint is not binding), another unit does not change the optimum, so the shadow price is zero.
More Linear programming and the simplex method questions
GATE 2022 ME (ME2) Q42– A manufacturing unit produces two products P1 and P2. For each piece of P1 and P2, the…
GATE 2020 ME (ME1) Q57– Shveta and Ashok independently produce A and B in two states, selling at ₹2000/kg and…
GATE 2018 ME (ME1) Q61– Minimize 3x+5y subject to 3x+5y15, 4x+9y8, 13x+2y2 and x,y0. The minimum is .
GATE 2018 ME (ME2) Q45– Maximize z=x 1-x 2 subject to x 1+x 210, x 10, x 20, x 25. The problem has .
GATE 2017 ME (ME2) Q61– Maximize Z=5x 1+3x 2 subject to x 1+2x 210, x 1-x 28, x 1,x 20. Initially both variables…
GATE 2016 ME (ME1) Q65– Maximize Z=15X1 + 20X2 subject to 12X1 + 4X2 ≥ 36 12X1 − 6X2 ≤ 24 X1, X2 ≥ 0 The above…