GATE ME 2020 Set 1 — Question 57
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+2 / -0MediumLP (Graphical & Simplex)Operations ResearchIndustrial Engineering
Industrial Engineering → Operations Research → LP (Graphical & Simplex)
Last updated
Question
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 10 kg per day, and ii) the respective state regulations restrict Shveta's production of A to less than 20 kg per day, and Ashok's production of A to less than 15 kg 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).
Correct answer
9.9 to 10.1
Solution
1. Define Variables and Objective Functions:
Let and be the quantities (in kg) of products A and B, respectively.For both Shveta and Ashok, the selling prices are:
Product A: Rs. 2,000 per kg
Product B: Rs. 3,000 per kg2. Formulate Shveta's Linear Programming Problem:
Objective: Maximize Revenue Constraints for Shveta:
(i) Daily production of A has to be at least as much as B:
(ii) Upper limit for production of B is 10 kg per day:
(iii) State regulations restrict Shveta's production of A to less than 20 kg per day:
(iv) Non-negativity constraints: To find the optimal revenue, we consider the boundary of the feasible region. For , the maximum value of approaches 20. So, we evaluate the objective function at the vertices of the feasible region defined by , , , .Vertices of Shveta's feasible region:
Objective: Maximize Revenue Constraints for Ashok:
(i) Daily production of A has to be at least as much as B:
(ii) Upper limit for production of B is 10 kg per day:
(iii) State regulations restrict Ashok's production of A to less than 15 kg per day:
(iv) Non-negativity constraints: Similar to Shveta's problem, we consider for finding the supremum of the revenue.Vertices of Ashok's feasible region:
Absolute difference Rupees.5. Convert to Thousand Rupees and Round Off:
.
Rounding off to 2 decimal places, the value is .The final answer is .
Let and be the quantities (in kg) of products A and B, respectively.For both Shveta and Ashok, the selling prices are:
Product A: Rs. 2,000 per kg
Product B: Rs. 3,000 per kg2. Formulate Shveta's Linear Programming Problem:
Objective: Maximize Revenue Constraints for Shveta:
(i) Daily production of A has to be at least as much as B:
(ii) Upper limit for production of B is 10 kg per day:
(iii) State regulations restrict Shveta's production of A to less than 20 kg per day:
(iv) Non-negativity constraints: To find the optimal revenue, we consider the boundary of the feasible region. For , the maximum value of approaches 20. So, we evaluate the objective function at the vertices of the feasible region defined by , , , .Vertices of Shveta's feasible region:
- (from and )
- (from and )
- (from and )
Objective: Maximize Revenue Constraints for Ashok:
(i) Daily production of A has to be at least as much as B:
(ii) Upper limit for production of B is 10 kg per day:
(iii) State regulations restrict Ashok's production of A to less than 15 kg per day:
(iv) Non-negativity constraints: Similar to Shveta's problem, we consider for finding the supremum of the revenue.Vertices of Ashok's feasible region:
- (from and )
- (from and )
- (from and )
Absolute difference Rupees.5. Convert to Thousand Rupees and Round Off:
.
Rounding off to 2 decimal places, the value is .The final answer is .
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE ME question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Operations Research
2026 Set 1 Q46An objective function of primal variables ( and ) is described below: Minimize…2026 Set 1 Q47Four jobs are on order in a factory. As on day 20 of the production calendar, the corresponding due…2026 Set 1 Q60The actual demand for castings in a factory is units and units for the months of…2026 Set 1 Q61The inventory holding cost of an item is ₹ 0.50 per unit per month and the ordering cost per order…2026 Set 1 Q65The activities of a PERT network and their corresponding activity time estimates (in weeks) i.e.,…