Consider the linear program max x 1 + x2 s.t. x1 + x2 … 9

-2x1 + x2 … 0 x1 - 2x2 … 0 x1, x2 Ú 0

(a) Solve the problem graphically.

(b) Add slacks x3,c, x5 to place the model in standard form.

(c) Apply rudimentary simplex Algorithm 5A 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).

(e) How can the algorithm be making progress when l = 0 if some moves of part

(c) left the solution unchanged? Explain.