Linear Programming

Step 1: Graph the constraints.
The first inequality is . Rewriting this as , we plot the line . The second inequality is . Rewriting this as , we plot the line . The third inequality is . Rewriting this as , we plot the line . The constraints and mean that the feasible region is in the first quadrant.

Step 2: Find the feasible region.
The feasible region is the area where all the constraints are satisfied simultaneously. This region is bounded by the lines , , and , and is confined to the first quadrant.

Step 3: Find the corner points.
The corner points of the feasible region are found by solving the system of equations corresponding to the intersection points of the constraint lines. The corner points are:

Step 4: Calculate the value of at each corner point.
Substitute the coordinates of each corner point into the objective function : - At : - At : - At : - At :

Step 5: Find the maximum value of .
The maximum value of occurs at , where .

Final Answer: The maximum value of is at the point .