Let's assume that mixture contains X kg of food X and Y kg of food Y.
Cost of 1 kg of food X =16 Rs
Cost of 1 kg of food Y =20 Rs
So, Total cost (C) =16X+20Y Rs ...(1)
Now, food X contains 1 units and food Y contains 2 units of Vitamin A.
So, Total Vitamin A =X+2Y units
Since, minimum requirement of Vitamin A is 10 units.
∴X+2Y≥10 ...(2)
Again, food X contains 2 units and food Y contains 2 units of Vitamin B.
So, Total Vitamin B =2X+2Y units
Since, minimum requirement of Vitamin B is 12 units.
∴2X+2Y≥12
⇒X+Y≥6 ...(3)
Also, food X contains 3 units and food Y contains 1 units of Vitamin C.
So, Total Vitamin C =3X+Y units
Since, minimum requirement of Vitamin C is 8 units.
∴3X+Y≥8 ...(4)
Since, amount of food can never be negative.
So, X≥0,Y≥0 ...(5)
We have to minimise the cost of mixture given in equation (1) subject to the constraints given in (2),(3), (4) and (5).
After plotting all the constraints, we get the feasible region as shown in the image.
Corner points | Value of Z=16X+20Y |
A (0,12) | 160 |
B (3,6) | 116 |
C (9,2) | 112 (minimum) |
D (10,0) | 160 |
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<112 to check if there exist some points in feasible region where value can be less than 112.
⇒16X+20Y<112
⇒4X+5Y<28.
Since there is no common points between the feasible region and the region which contains Z<112 (See the image). So 112 Rs is the minimum cost.