GATE 2022 ME Set 1 · Question 21
In a linear programming problem, if a resource is not fully utilized, the shadow price of that resource is
- A
positive
- B
negative
- C
zero
- D
infinity
GATE 2022 · Mechanical Engineering · Set 1 · IIT Kharagpur
Answer
From the official answer key published by IIT Kharagpur.
Worked solution
The shadow price (dual variable) represents the marginal increase in the objective function value resulting from a one-unit increase in the availability of a resource.
According to the principle of complementary slackness in linear programming:
where is the slack variable representing the unused amount of the resource, and is its corresponding shadow price.
If a resource is not fully utilized, there is an excess or surplus of that resource, meaning the slack variable is strictly positive (). Consequently, adding more of an already underutilized resource will not improve the objective function value. Therefore, its shadow price must be zero ().
Answer: (C) zero
Practise Linear Programming and Simplex Method
14 GATE questions from this chapter, in short untimed sets, with the formula sheet beside them. Free.
More from Linear Programming and Simplex Method
- GATE 2022 ME Set 2 · Q42A manufacturing unit produces two products P1 and P2. For each piece of P1 and P2, the table below provides…
- GATE 2020 ME Set 1 · Q57Two business owners Shveta and Ashok run their businesses in two different states. Each of them, independent…
- GATE 2018 ME Set 2 · Q45The problem of maximizing z = x1 - x2 subject to constraints x1 + x2 ≤ 10, x1 ≥ 0, x2 ≥ 0 and x2 ≤ 5 has
- GATE 2017 ME Set 1 · Q51Two models, P and Q, of a product earn profits of Rs. 100 and Rs. 80 per piece, respectively. Production…
- GATE 2017 ME Set 2 · Q51Maximize Z = 5x1 + 3x2, subject to x1 + 2x2 ≤ 10, x1 - x2 ≤ 8, x1, x2 ≥ 0. In the starting Simplex tableau,…
- GATE 2016 ME Set 1 · Q65Maximize Z = 15X1 + 20X2 subject to 12X1 + 4X2 ≥ 36 12X1 - 6X2 ≤ 24 X1, X2 ≥ 0 The above linear programming…
Question from the official GATE 2022 ME paper (Set 1), IIT Kharagpur. Solutions by PARIXO AI. All 65 questions of this paper.