Corner Point Method: on a bounded feasible region, evaluate Z at every corner point. The largest value is the maximum. If two corners tie, every point of the segment joining them is optimal.
Given: the table of hours above, with profits ₹500 per saree and ₹300 per stole.
To find: (i) the most profitable plan; (ii) the optimum after the stole profit becomes ₹500.
Step 1 — Formulate. Let x sarees and y stoles be made in a week.
- Weaving: 6x+2y≤120, i.e. 3x+y≤60.
- Dyeing: 2x+2y≤48, i.e. x+y≤24.
- Finishing: x+3y≤60.
- x≥0, y≥0.
Maximise Z=500x+300y.
Step 2 — Corner points. The feasible region is the bounded pentagon OABCD.
- O(0,0).
- A: 3x+y=60 meets y=0 at (20,0). Check: x+y=20≤24 and x+3y=20≤60.
- B: 3x+y=60 and x+y=24. Subtracting gives 2x=36, so x=18, y=6. Check: x+3y=36≤60.
- C: x+y=24 and x+3y=60. Subtracting gives 2y=36, so y=18, x=6. Check: 3x+y=36≤60.
- D: x+3y=60 meets x=0 at (0,20). Check: x+y=20≤24.

Step 3 — Evaluate both objective functions.
| Corner point | Z=500x+300y | Z′=500x+500y |
|---|
| O(0,0) | 0 | 0 |
| A(20,0) | 10000 | 10000 |
| B(18,6) | 10800 (maximum) | 12000 (maximum) |
| C(6,18) | 8400 | 12000 (maximum) |
| D(0,20) | 6000 | 10000 |
Step 4 — Part (i). The maximum of Z is 10800, at B(18,6) only.
Step 5 — Part (ii). Now Z′=500(x+y), which is parallel to the dyeing line x+y=24. The maximum 12000 occurs at both B and C, and therefore at every point of segment BC:
x+y=24,6≤x≤18
With whole numbers of pieces, these are the 13 plans (6,18),(7,17),…,(18,6).
Answer: (i) Make 18 sarees and 6 stoles a week, for a maximum profit of ₹10,800. (ii) The maximum profit becomes ₹12,000. It is earned by every plan with x+y=24 and 6≤x≤18, for example 12 sarees and 12 stoles.
Note: In (ii) dyeing is the binding constraint: every optimal plan uses all 48 dyeing hours.