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