Prashnikaप्रश्निका
Code
About
‹ Back to the paper

Question 22(ii)

4 marks

MathematicsISC 2023 Specimen Mathematics Paper 1Linear programmingLinear Programming

Solve the following linear programming problem.

The standard weight of a special purpose brick is 5 kg and it must contain two basic ingredients B₁…

The standard weight of a special purpose brick is $5\text{ kg}$ and it must contain two basic ingredients $B_1$ and $B_2$. $B_1$ costs ₹ $5$ per kg and $B_2$ costs ₹ $8$ per kg. Strength considerations dictate that the brick should not contain more than $4\text{ kg}$ of $B_1$ and minimum $2\text{ kg}$ of $B_2$. Since the demand for the product is likely to be related to the price of the bricks, find the minimum cost of the brick satisfying the above conditions. Formulate this situation as an L.P.P. and solve it graphically.
Open in the LPP solver (graphical method)

Answer

Answer

Objective: Minimise Z = 5x + 8y

Constraints: x + y = 5; x <= 4; y >= 2; x, y >= 0

Corner point (x, y)Z
(0, 5)40
(3, 2)31 (optimal)

Minimum: Z = 31 at (3, 2)

Let the brick contain $x$ kg of $B_1$ and $y$ kg of $B_2$. Minimise the cost $Z = 5x + 8y$ subject to $x + y = 5$, $x \le 4$, $y \ge 2$, $x, y \ge 0$. From $y = 5 - x \ge 2$ we get $x \le 3$, so the feasible region is the line segment of $x + y = 5$ from $(0, 5)$ to $(3, 2)$. Corner points: at $(0, 5)$, $Z = 40$; at $(3, 2)$, $Z = 15 + 16 = 31$. Hence the minimum cost is ₹ $31$ per brick, with $3$ kg of $B_1$ and $2$ kg of $B_2$.