Consider the objective function subject to the following constraints:
Find the feasible region and list the corner points.
Corner points:
If there is more than one corner point, type the points separated by a comma (i.e. (1,2),(3,4)).

Find the maximum and minimum values of .
Maximum value of is: when and
Minimum value of is: when and

You can earn partial credit on this problem.