Please Solve RD Sharma Class 12 Chapter 29 Linear Programming Exercise 29.4 Question 31 Maths Textbook Solution.
Answer:.
The answer of the given question B that the maximum profit is Rs.120 obtained when 12 units of articles A and 6 units of articles B were manufactured.
Hint:
By using the mathematical formulation of the given Linear programming is Max Z=ax + by
Given:
The maximum capacity of first department is 60 hours a week and that of other department is 48 hours per week. The product of each unit of article A requires 4 hours in assembly and 2 hours in finishing and that of each unit of B requires 2 hours in assembly and 4 hours in finishing.
Solution:
Let x units and y units of articles A and B are produced respectively.
Number of articles can’t be negative.
Therefore,
The product of each unit of article A requires 4 hours in assembly and that of articles B requires 2 hours in assembly and the maximum capacity of the assembly department in 60 hours a week.
The product of each unit of article A requires 2 hours in finishing and that of articles B requires 4 hours in assembly and the maximum capacity of the finishing department in 48 hours a week.
If the profit is Rs.6 for each unit of A and Rs.8 for each unit of B. Therefore, profit gained from x units and y units of articles A and B respectively is Rs.6x and Rs.8y respectively.
Total revenue = Z = 6x + 8y which is to be maximized.
Thus, the mathematical formulation of the given linear programming problem is
Max Z = 6x + 8y
Subject to
First, we will convert in in equations into equations as follows:
Region represented by : the line meets the coordinate axes at A1(24,0) and B1(0,12)respectively.
By joining these points we obtain the line . Clearly (0,0) satisfies the . So
The region which contains origin represents the solution set of the in equation .
Region represented by : the line meets the coordinate axes at C1(15,0) and B1(0,30)respectively.
By joining these points we obtain the line . Clearly (0,0) satisfies the . So
The region which contains origin represents the solution set of the in equation .
Region represented by : Since, every point in the first quadrant satisfies these in equations. So, the first quadrant is the region represented by the in equation
The feasible region determined by the system of constraints are as follows.
The corner points are O(0,0), B(0,12),E1(12,6) and C1(15,0)
The values of Z at these corner points as follows.
Corner Points |
|
O |
0 |
B1 |
96 |
E1 |
120 |
C1 |
90 |
The maximum value of Z is 120 which is attained at E1(12,6)
Thus, the maximum profit is Rs. 120 obtained when 12 units of articles A and 6 units of Article B were manufactured.