Problem Statement
A manufacturer has three machines (I, II, and III) installed in his factory. Machine I and II can be operated for at most 12 hours, while machine III must be operated for at least 5 hours a day. He produces two items, M and N, each requiring the use of all three machines.
The number of hours required for producing 1 unit of M and N on the three machines are given in the following table:
| Items | Machine I (hrs) | Machine II (hrs) | Machine III (hrs) |
|---|
| M | 1 | 2 | 1 |
| N | 2 | 1 | 1.25 |
The manufacturer makes a profit of ₹600 for each unit of M and ₹400 for each unit of N. The goal is to determine how many units of each item should be produced to maximize the profit, assuming that all the items produced can be sold.
Step 1: Define Variables
Let:
- x be the number of units of item M produced.
- y be the number of units of item N produced.
Step 2: Objective Function (Profit)
The profit per unit of M is ₹600, and the profit per unit of N is ₹400. Therefore, the objective function (total profit) is:
Z=600x+400y
where Z is the total profit.
Step 3: Constraints
-
Machine I hours constraint: Machine I can be operated for a maximum of 12 hours per day. The total hours for machine I are:
1x+2y≤12
-
Machine II hours constraint: Machine II can be operated for a maximum of 12 hours per day. The total hours for machine II are:
2x+1y≤12
-
Machine III hours constraint: Machine III must be operated for at least 5 hours per day. The total hours for machine III are:
1x+1.25y≥5
-
Non-negativity constraints: The number of units produced must be non-negative:
x≥0,y≥0
Step 4: Solve the Linear Programming Problem
We need to maximize:
Z=600x+400y
subject to the constraints:
- 1x+2y≤12
- 2x+1y≤12
- 1x+1.25y≥5
- x≥0, y≥0
Step 5: Graphical Method
Step 5.1: Plot the Constraints
The lines representing the constraints are:
- 1x+2y=12 intersects the x-axis at x=12 and the y-axis at y=6.
- 2x+1y=12 intersects the x-axis at x=6 and the y-axis at y=12.
- 1x+1.25y=5 intersects the x-axis at x=5 and the y-axis at y=4.
Step 5.2: Find the Feasible Region
The feasible region is bounded, with corner points (5,0), (6,0), (4,4), (0,6) and (0,4); (4,4) is where x+2y=12 meets 2x+y=12.
Step 5.3: Evaluate the Objective Function at Corner Points
Z(5,0)=3000, Z(6,0)=3600, Z(4,4)=4000, Z(0,6)=2400, Z(0,4)=1600. So the optimal solution is:
- x=4 units of M
- y=4 units of N
Step 6: Calculate the Maximum Profit
Substitute x=4 and y=4 into the objective function:
Z=600(4)+400(4)=2400+1600=4000
Final Answer:
The manufacturer should produce 4 units of M and 4 units of N to maximize profit, and the maximum profit is ₹4000.
