Need solution for RD Sharma maths Class 12 Chapter 29 Linear Programming Exercise Multiple Choice Question Question 15 textbook solution.
Answer : (d)
Hint :
Convert the given inequalities into equation
Given:
subject to the constraints
Solution:
Let us consider the mentioned constraints as equations for a while,
....(i)
....(ii)
Now, graph the equations by transforming the equations to intercept form of line.
Equation (i) dividing throughout by
The line can be plot in the graph as a line passing through the points, and as and are the intercepts of the line on the x-axis and y-axis respectively.
Similarly, Equation (ii) can be divided by
The line can be plot in the graph as a line passing through the points, and as and are the intercepts of the line on the x-axis and y-axis respectively.
By considering the constraints and , thus clearly shows that the region can only be in the first quadrant. The graph of inequalities will look like,
The points OABC is the feasible region of LPP
Now, form the points O,A,B and C the vertices of polygon formed by the constraints one of the points will provide the maximum solution
Now, checking the points, O, A, B, and C by substituting in
From the values, it is cler that maximized at