Assume that the cake of one kind be
Tabulate the given data as,
Flour(g) | Fat(g) | |
Cakes of first kind, | 200 | 25 |
Cakes of second kind, | 100 | 50 |
Availability | 5000 | 1000 |
The required constraints are,
And,
The objective function which needs to maximize is,
The line
x | 0 | 25 |
y | 50 | 0 |
Also, when
This is true, so the graph have the shaded region towards the origin.
The line
x | 0 | 40 |
y | 20 | 0 |
Also, when
This is true, so the graph have the shaded region towards the origin.
By the substitution method, the intersection points of the lines
Plot the points of all the constraint lines,
It can be observed that the corner points are
Substitute these points in the given objective function to find the minimum value of Z.
Corner Points | |
| 0 |
| 25 |
| 30 (maximum) |
| 20 |
The maximum value of
Therefore, the maximum numbers of cakes that can be made are 30.