Step 1: Understanding the Concept:
The optimal value (minimum or maximum) of an objective function in a Linear Programming Problem (LPP) always occurs at one of the corner points of the feasible region.
Step 2: Formula Application:
Evaluate $z = 3x + 9y$ at each point:
1. At (0, 10): $z = 3(0) + 9(10) = 90$
2. At (5, 5): $z = 3(5) + 9(5) = 15 + 45 = 60$
3. At (15, 15): $z = 3(15) + 9(15) = 45 + 135 = 180$
4. At (0, 20): $z = 3(0) + 9(20) = 180$
Step 3: Explanation:
Comparing the values: 90, 60, 180, and 180. The smallest value is 60.
Step 4: Final Answer:
The minimum value is 60.