To solve this problem, we need to formulate a Linear Programming Problem (LPP) to maximize the earnings of two tailors, A and B. Given:
- Tailor A earns ₹150/day and can stitch 6 shirts and 4 pants per day.
- Tailor B earns ₹200/day and can stitch 10 shirts and 4 pants per day.
Objective: Maximize the total earnings, Z, from working x days for tailor A and y days for tailor B.
Objective Function: Maximize Z = 150x + 200y
Constraints:
- To produce at least 60 shirts: 6x + 10y ≥ 60
- To produce at least 32 pants: 4x + 4y ≥ 32
- Non-negativity constraints: x, y ≥ 0
Therefore, the correct formulation of the LPP is:
Maximize Z = 150x + 200y, subject to:- 6x + 10y ≥ 60
- 4x + 4y ≥ 32
- x, y ≥ 0