Please Solve RD Sharma Class 12 Chapter 29 Linear Programming Exercise 29.4 Question 7 Maths Textbook Solution.
Answer:
15 tea cups of type A and 30 tea cups of type B.
Hint:
Let required number of tea cups of type A and B are x and y.
Given:
Profit on each tea cups of type A and B are 75 paisa and 50 paisa.
Solution:
Let the total profit of on tea cups be z.
Where x and y are the required number of tea cups.
Since each tea cup of type A and B require the work machine 1 for 12 and 6 min but total time available on machine I is 6×60 = 360min
Since each tea cup of type A and B require to work machine II for 6 and 0 min but total time available for machine II is 6×60=360min.
Since each tea cup of type A and B require the work machine III for 6 and 9 min. but total time available for machine III is 6×60=360min.
The required LPP is
Max
Subject to constraints
...(i)
....(ii)
...(iii)
The feasible region obtains by the system of constraint
Point (20,20) and Q(15,30) is obtain by solving (ii) and (iii) and (i) and (iii).
Corner Points |
Value of |
Hence z is maximum at x=15, y=30.
15 tea cups of type A and 30 tea cups of type B, we need to maximize the profit.