Q. 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 solution of the LP. Are there alternative optimal solutions?
(c) Assumed the objective function is changed to do you desire to re-graph the feasible region of this LP? Why? Illustrate what is the solution for the new LP? Are there alternative optimal solutions?