1. Let number of item M produced be x and that of item N be y.
Machine I (given):
Hours worked for product M = 1 hour
Hours worked for product N = 2 hours
Maximum hours available = 12
Thus constraint equation will be:
Machine II (given):
Hours worked for product M = 4 hours
Hours worked for product N = 3 hours
Thus constraint equation will be:
Maximum hours available = 12
Machine III (given):
Hours worked for product M = 0 hour
Hours worked for product N = 0 hours
Minimum hours = 5
Since both products don't use machine III, there will be no constraint.
Profit on item M = Rs 600
Profit on item N = Rs 400
We want to maximize the profit, hence the function used is maximize Z.
Thus profit maximization function will be:
Z = 600x + 400y
Combining all constraints:
Max Z = 600x + 400y
subject to:
2. Please note: I have solved the equation by graphical method which is provided in the hint. The equation solved as per the given data in part 1 results in infeasible answers.
The graph is as below:
The lines intersect on points (6,3)
Substituting x = 6 and y = 3 in the maximize function:
Max Z = 800x + 200y
Z = 800 * 6 + 200 * 3
Z = 4800 + 600
Z = 5400
Thus maximum profit that can be earned = Rs 5400
Q4: 3 marks A manufacturer has three machines I, Il and Il installed in his factory....