For the following LP,
maximize x1 + 2x2
subject to x1 + x2
10x1 + 20x2
x1 ≥ 0
x2 ≥ 0
(a) Graph the feasible region for the linear program. Clearly label all the intercepts.
(b) Find the optimal solution of the LP. Is it unique?
(c) Supposed the objective function is changed to , do you need to re-graph the feasible region of this LP? Why? What is the solution for the new LP? Is it unique?