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

Question 22

6 marks

MathematicsISC 2020 Mathematics Paper 1Linear programmingLinear Programming

Solve the following linear programming problem.

A company uses three machines to manufacture two types of shirts, half sleeves and full sleeves…

A company uses three machines to manufacture two types of shirts, half sleeves and full sleeves. The number of hours required per week on machine $M_1$, $M_2$ and $M_3$ for one shirt of each type is given in the following table:
$M_1$$M_2$$M_3$
Half sleeves128/5
Full sleeves218/5
None of the machines can be in operation for more than 40 hours per week. The profit on each half sleeve shirt is ₹ 1 and the profit on each full sleeve shirt is ₹ 1·50. How many of each type of shirts should be made per week to maximize the company’s profit?
Open in the LPP solver (graphical method)

Answer

Answer

Objective: Maximise Z = x + 1.5y

Constraints: x + 2y <= 40; 2x + y <= 40; x + y <= 25; x, y >= 0

Corner point (x, y)Z
(0, 0)0
(0, 20)30
(10, 15)65/2 (optimal)
(15, 10)30
(20, 0)20

Maximum: Z = 65/2 at (10, 15)

Let $x$ half sleeve shirts and $y$ full sleeve shirts be made per week. Maximise $Z = x + 1.5y$ subject to: $x + 2y \le 40$ (machine $M_1$), $2x + y \le 40$ (machine $M_2$), $\frac{8}{5}x + \frac{8}{5}y \le 40$ i.e. $x + y \le 25$ (machine $M_3$), $x, y \ge 0$. Corner points of the feasible region and $Z$: $(0, 0)$: $Z = 0$ $(20, 0)$: $Z = 20$ $(15, 10)$: $Z = 30$ $(10, 15)$: $Z = 32.5$ $(0, 20)$: $Z = 30$ Hence the profit is maximum at ₹ $32.50$ when $10$ half sleeve and $15$ full sleeve shirts are made per week.