Consider the following linear programming problem:
Max x_1+ ?2x?_2
s.t. x_1 + x_2 ≤ 3
x_1 - x_2 ≥ 0
x_2 ≤ 1
x_1, x_2 ≥ 0
a. Identify the feasible region.
b. Are any of the constraints redundant? If yes, then identify the constraint that is redundant.
c. List all the extreme points. Which one is the optimal solution?