Let x and y units of packet of mixes are purchased from S and T respectively. If z is total cost then
z = 10x + 4y ...(i)
isobjective function which we have to minimize
Here constraints are.
On plotting graph of above constraints or inequalities (ii), (iii) , (iv) and (v) we get shaded region having corner point A, P, B as feasible region.
For coordinate of P
Point of intersection of
2x + y = 60 ...(vi)
and 4x + y = 80 ...(vii)
(vi) – (vii) => 2x + y - 4x - y = 60 - 80
=> -2x = -20 Þ x = 10
=>y = 40
co-ordinate of P ≡(10, 40)
Now the value of z is evaluated at corner point in the following table
Since feasible region is unbounded. Therefore we have to draw the graph of the inequality.
10x + 4y < 260 ...(viii)
Since the graph of inequality (viii) does not have any point common.
So the minimum value of z is 260 at (10, 40).
i.e., minimum cost of each bottle is Rs.260 if the company purchases 10 packets of mixes from S and 40 packets of mixes from supplier T.