To find the maximum and minimum values of the given objective function, we first need to determine the feasible region based on the given constraints.
The constraints are given by the inequalities:
We can find the boundary lines of the region by treating the inequalities as equations:
For the line , we find where it crosses the coordinate axes. Putting gives , which gives us the point . Putting gives , giving us the point .
Checking the origin , we see that is true. This means the region lies towards the origin.
For the line , putting gives , so we get the point . Putting gives , which gives the point .
Checking the origin , we see that is false. This means the region lies away from the origin.
The constraints and restrict our feasible region to the first quadrant.
When we observe these conditions together, we get a bounded feasible region in the first quadrant. The corner points (vertices) of this region are simply the intersection points of the lines with the coordinate axes:
, , , and .
Now, we calculate the value of the objective function at each of these corner points to find the maximum and minimum values.
At the point :
At the point :
At the point :
At the point :
From these calculations, the maximum value of is and the minimum value of is .
We are asked to find the difference between the maximum and minimum values.
Option C is the correct answer.