Consider the following linear program. max x1 + x2 s.t. x1 + x2 ≤ 9 − 2x1 + x2 ≤ 0 x1 − 2x2 ≤ 0 x1, x2 ≥ 0
a) Solve the problem graphically.
b) Add slacks x3, . . . , x5 to place the model in standard form.
c) Apply simplex algorithm to compute an optimal solution to your standard form starting with all slacks basic.
d) Plot your progress in part (c) on the graph of part (a).