Question Details

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)

Show Answer
Correct Answer

Correct answer is : 10

Maximuum z = 2000x1 + 3000 x2

A → x1 units

x1 ≥ x2

B → x2 units

x2 ≥ 10

x1 < 20

x1 < 15

Shveta's Profit = Rs. 70000 at (20,10)

Ashok's Profit = Rs. 60000 at (15,10)

Difference Rs. 10000

∴ The answer will be 10 as it is asked in a thousand Rupees.

Solution :

The correct answer is 10.

To understand why, let us formulate and solve the Linear Programming Problem (LPP) for both business owners, Shveta and Ashok.

Let the daily production quantities of product A and product B be x1 kg and x2 kg, respectively.
The selling prices of product A and product B are Rs. 2,000 per kg and Rs. 3,000 per kg, respectively. Since everything produced is sold, the objective of both owners is to maximize their daily revenue, represented by:
Maximize Z=2000x1+3000x2

Constraints for both business owners:
1. The daily production of A has to be at least as much as B:
x1≥x2
2. The upper limit for production of B is 10 kg per day (i.e., B can be produced up to 10 kg):
x2≤10
Additionally, production quantities must be non-negative: x1≥0, x2≥0.

1. Shveta's Optimal Revenue:
State regulations restrict Shveta's production of A to less than 20 kg per day. In the context of maximizing revenue with continuous limits, we consider the boundary condition:
x1≤20
To maximize the objective function Z=2000x1+3000x2, we want to make x2 as large as possible because it has a higher coefficient (3000 vs 2000).
The maximum possible value for x2 is 10 (since x2≤10).
Since x1≥x2, and we want to maximize both variables, the optimal production occurs at the upper bounds:
x1=20 and x2=10 (which satisfies 20≥10).
Evaluating Shveta's maximum revenue:
ZShveta=2000(20)+3000(10)=40000+30000=Rs. 70000

2. Ashok's Optimal Revenue:
State regulations restrict Ashok's production of A to less than 15 kg per day:
x1≤15
Similarly, to maximize revenue, we choose the maximum values within the feasible region.
The maximum value for x2 is 10, and the maximum value for x1 is 15 (which satisfies 15≥10).
Evaluating Ashok's maximum revenue:
ZAshok=2000(15)+3000(10)=30000+30000=Rs. 60000

Absolute Difference in Daily Revenue:
The difference between Shveta's and Ashok's optimal daily revenues is:
Difference=70000-60000=Rs. 10000

Since the question asks for the difference in thousand Rupees:
100001000=10

Transparent Access on Mindyard

Built for Learners & Educators Alike

Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.

FREE FOR STUDENTS

Practice & Learn Free for Students

Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.

  • Unlimited mock tests & question bank practice
  • Full access to curated study library & formula notes
  • 100% free for students • No credit card required
2 MONTHS FREE TRIAL

Educators & Coaching Institutes

Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.

  • AI question uploader & rapid test generator
  • Anti-cheating tab proctoring & performance reports
  • Full Pro access free for 60 days • No upfront commitment
Discover more resources

You may also like

Mock Tests

View All
  • CAT
  • intermediate
  • 3 hours
  • data interpretation (di), quant, verbal ability and reading comprehension (varc)

Prepare effectively for CAT 2017 Slot 1 with this complete question paper and detailed solutions. This paper includes all sections—Verbal Ability & Reading Comprehension (VARC), Data Interpretation & Logical Reasoning (DILR), and Quantitative Aptitude (QA)—with step-by-step explanations to help you understand concepts, improve problem-solving speed, and strengthen your exam strategy. Practicing the CAT 2017 Slot 1 paper is an excellent way to experience the actual exam pattern, difficulty level, and question types asked in the Common Admission Test. This resource is ideal for MBA aspirants targeting top IIMs and other leading B-schools.

  • CAT
  • beginner
  • 3 hours
  • data interpretation (di), quant, verbal ability and reading comprehension (varc)

Prepare for CAT 2017 Slot 2 with the complete question paper and detailed solutions. This paper covers all three sections—Verbal Ability & Reading Comprehension (VARC), Data Interpretation & Logical Reasoning (DILR), and Quantitative Aptitude (QA)—with clear, step-by-step explanations to help you master important concepts and improve your problem-solving speed. Solving the CAT 2017 Slot 2 paper gives you valuable insight into the actual exam pattern, question types, and difficulty level of the Common Admission Test. It is an essential practice resource for MBA aspirants aiming for admission to IIMs and other top B-schools.

Ask AI Tutor
5 left
Q1 View Question & Options
AI Tutor is solving this question...
Reading question context & options...
Ask your own doubt or choose a quick prompt: