Let x units of food F1 and y units of food F2 are required to be mixed.
Cost = Z = 4x + 6y ........(i) is to be minimised subject to following constraints.
3x + 6y ≥ 80 .........(ii)
4x + 3y ≥ 100 .......(iii)
x ≥ 0, y ≥ 0 ...(iv)
To solve the LPP graphically, the graph is plotted as shown.
The shaded regions in the graph is the feasible solution of the problem. The corner points are
The value of Z at corner point is given as.
Since, feasible region is unbounded therefore a graph of 4x + 6y < 104 is drawn which is shown in figure by dotted line.
Also, since there is no point common in feasible region and region 4x + 6y < 104 .
Hence, for minimum cost Rs 104, 24 units of food F1 and 43 units of food F2 is required.