GATE 2020 ME Set 1 · Question 57
Two business owners Shveta and Ashok run their businesses in two different states. Each of them, independent of the other, produces two products A and B, sells them at Rs. 2,000 per kg and Rs. 3,000 per kg, respectively, and uses Linear Programming to determine the optimal quantity of A and B to maximize their respective daily revenue. Their constraints are as follows: i) for each business owner, the production process is such that the daily production of A has to be at least as much as B, and the upper limit for production of B is per day, and ii) the respective state regulations restrict Shveta's production of A to less than per day, and Ashok's production of A to less than per day. The demand of both A and B in both the states is very high and everything produced is sold.
The absolute value of the difference in daily (optimal) revenue of Shveta and Ashok is ________ thousand Rupees *(round off to 2 decimal places)*.
GATE 2020 · Mechanical Engineering · Set 1 · IIT Delhi · printed as Q.47 in the ME section
Answer
From the official answer key published by IIT Delhi.
Worked solution
Let and denote the daily production of products A and B in kg, respectively. The daily revenue objective function to maximize is:
The common constraints are:
For Shveta:
With the state restriction , the corner points of the feasible region are , , , and . Evaluating the revenue at these points:
- At :
- At :
Thus, Shveta's optimal daily revenue is .
For Ashok:
With the state restriction , the corner points are , , , and :
- At :
Thus, Ashok's optimal daily revenue is .
The absolute difference in optimal daily revenue is:
Answer: 10
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 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…
- GATE 2016 ME Set 3 · Q65A firm uses a turning center, a milling center and a grinding machine to produce two parts. The table below…
- GATE 2015 ME Set 3 · Q61For the linear programming problem: arrayll Maximize Z = 3X1 + 2X2 Subject to -2X1 + 3X2 ≤ 9 X1 - 5X2 ≥ -20…
Question from the official GATE 2020 ME paper (Set 1), IIT Delhi. Solutions by PARIXO AI. All 65 questions of this paper.