Consider the following problem. Maximize Z = X + X

Subject to X 2

X2 >= 2

X1 + X2 2

and X 0, X 0

Plot the feasible region and circle all the CPF solutions.

For each CPF solution, identify the pair of constraint boundary equations that it satisfies.

For each CPF solution, use this pair of constraint boundary equations to solve algebraically for the values of X and x at the corner point.

For each CPF solution, identify its adjacent CPF

solutions.

For each pair of adjacent CPF solutions, identify the constraint boundary they share by giving its equation.