Let the number of toys of type A be
Items | Number | Machine I | Machine II | Machine III | Profit |
Type A | | | | | Rs. |
Type B | | | | | Rs. |
Max available time | | | |
The equation for machine A is given as,
The equation for machine B is given as,
The equation for machine C is given as.
We need to maximize the cost so we can use function which
All constraints are given as,
| | |
| | |
| | 60 |
| 40 | |
Plot the graph using equations of constraint.
Substitute the value of
Corner points | Value of Z |
| |
| |
| |
| |
Thus, the cost will be maximum if the number of type A toys are