1. Consider the following linear programming problem:

Max x₁+ 2x₂

x_{1 +}x₂3

x₁- 2x₂ 0

x₂ 1

x_1,x₂ 0

1. Identify the feasible region. (12 points)

1. Are any of the constraints redundant? If yes, then identify the constraint that is

redundant. (10 points)

1. Find all the extreme points - list the value of x₁ and x₂ at each extreme point. (6 points)

1. What is the optimal solution? (5 points)