Let
x and
y be the number of packets of food
P and
Q respectively. Obviously
x≥0,y≥0. Mathematical formulation of the given problem is as follows :
Minimise
Z=6x+3y (vitamin A)
subject to the constraints
12x+3y≥240 (constraint on calcium), i.e.
4x+y≥80...(1)4x+20y≥460 (constraint on iron), i.e.
x+5y≥115...(2)6x+4y≤300 (constraint on cholesterol), i.e.
3x+2y≤150...(3)x≥0,y≥0...(4)Let us graph the inequalities
(1) to
(4).
The feasible region (shaded) determined by the constraints
(1) to
(4) is shown in Fig and note that it is bounded.
The coordinates of the corner points
L,M and
N are
(2,72),(15,20) and
(40,15) respectively. Let us evaluate
Z at these points:
Corner Point | Z=6x+3y |
(2,72) | 228 |
(15,20) | 150←Minimum |
(40,15) | 285 |
From the table, we find that
Z is minimum at the point
(15,20). Hence, the amount of vitamin A under the constraints given in the problem will be minimum, if
15 packets of food
P and
20 packets of food
Q are used in the special diet. The minimum amount of vitamin A will be
150 units.