Let's assume that mixture contains
X kg of food P type and
Y kg of food Q type.
Cost of 1 kg of food P =60 Rs
Cost of 1 kg of food Q =80 Rs
So, Total cost (C) =60X+80Y Rs ...(1)
Now, food P contains 3 units/kg of vitamin A and food Q contains 4 units/kg of vitamin A.
So, Total Vitamin A contains =3X+4Y
Since minimum requirement of Vitamin A is 8 units.
∴3X+4Y≥8 ...(2)
Also, food P contains 5 units/kg of vitamin B and food Q contains 2 units/kg of vitamin B.
So, Total Vitamin B contains =5X+2Y
Since the minimum requirement of Vitamin B is 11 units.
∴5X+2Y≥11 ...(3)
Since the amount of food can never be negative.
So, X≥0,Y≥0 ...(4)
We have to minimize the cost of mixture given in equation (1) subject to the constraints given in (2),(3) and (4).
After plotting all the constraints, we get the feasible region as shown in the image.
Corner points | Value of Z=60X+80Y |
(0,112) | 440 (Maximum) |
(2,12) | 160 (Minimum) |
(83,0) | 160 (Minimum) |
Now, since region is unbounded. Hence we need to confirm that minimum value obtained through corner points is true or not.
Now, plot the region Z<160 to check if there exist some points in the feasible region where value can be less than 160.
⇒60X+80Y<160
⇒3X+4Y<8.
Since there is no common points between the feasible region and the region which contains Z<160. So 160 is the minimum cost.