This linear programming problem requires the optimization of \( Z = 3x + 9y \) subject to the following constraints:
The feasible region is defined by the intersection of these inequalities.
| Constraint | Boundary Line Equation |
|---|---|
| \( x + 3y \leq 60 \) | \( x + 3y = 60 \) |
| \( x + y \geq 10 \) | \( x + y = 10 \) |
| \( x \leq y \) | \( x = y \) |
| \( x \geq 0 \) | \( x = 0 \) |
| \( y \geq 0 \) | \( y = 0 \) |
The feasible region is determined by plotting these boundary lines and finding their intersection points:
The vertices defining the feasible region are \( (0, 10) \), \( (0, 20) \), and \( (15, 15) \).
The objective function \( Z = 3x + 9y \) is evaluated at each vertex:
The maximum value of \( Z \) is 180. Since \( Z = 180 \) at both \( (0, 20) \) and \( (15, 15) \), the maximum value of \( Z \) is achieved at all points along the line segment connecting \( (0, 20) \) and \( (15, 15) \).