Explain solution RD Sharma class 12 Chapter 29 Linear Programming exercise 29.4 question 5
Answer:
Required number belt A is 200, while B is 600, maximum profit Rs1300.
Hint:
Let required number of belt A and B be x and y.
Given:
Profit on belt A and B be Rs2 and Rs1.50
Solution:
Let z be total profit
Where x and y be required number of belt A and belt B.
Since each belt of type A required twice as much time as belt B. let each belt B require to make, so A requires 2 hours but total time available is equal to production 1000 belt B that is 1000 hours, so
(first constraint)
Given supply of lather only for 800 belts per day both A and B combined, so
(second constraint)
Buckets available for A is only 400 and for B only 700, so
(third constraint)
(forth constraint)
Hence the required LPP
Subject to constraints
....(i)
....(ii)
.....(iii)
...(iv)
,number of belt cannot less than zero
The feasible region determined by the system of constraints
Obtain point Q(200,600) by solving (i) and (ii) and P(400,200) by solving (i) and (iii) and R(100,700) by solving (ii) and (iv)
The shading region is
Corner Points |
Value of |
0 |
|
Maximum profit = 1300, required number belt A = 200, belt B = 600