Suppose x gms of wheat and y grams of rice and mixed in the daily diet. Since every gram of wheat provides 0.1 gm of proteins and every gram of rice gives 0.05 gm of proteins. Therefore, x gms of wheat and y grams of rice will provide 0.1x + 0.05y gms of proteins. But the minimum daily requirement of proteins is of 50 gms.
Similarly, x gms of wheat and y gms of rice will provide 0.25x + 0.5y gms of carbohydrates and the minimum daily requirement of carbohydrates is of 200 gms.
Since the quantities of wheat and rice cannot be negative. Therefore,
x ≥ 0, y ≥ 0
It is given that wheat costs Rs 4 per kg and rice Rs 6 per kg. So, x gms of wheat and y gms of rice will cost Rs
Hence, the given linear programming problem is
Minimize
Subject to the constraints
The solution set of the linear constraints is shaded in fig. The vertices of the shaded region are A2 (800, 0), P (400, 200) and B1 (0, 1000).
The values of the objective function at these points are given in the following table.
Point (x1, x2)
|
Value of objective function
|
A2 (800, 0)
P (400, 200)
B1 (0, 1000)
|
|
Clearly, Z is minimum for x = 400, y = 200 and the minimum value of Z is 2.8.
We observe that the open half plane represented by does not have points is common with the feasible region. So, Z has minimum value 2.8 at x = 400 and y = 200.
Hence the diet cost in minimum when x = 400 and y = 200. The minimum diet cost is Rs 2.8.