Consider the objective function [math] subject to the following constraints: [math]

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 [math].
Maximum value of [math] is: when [math] and [math]
Minimum value of [math] is: when [math] and [math]

Your overall score for this problem is