Consider the linear program max 3 z1 + z2 s.t. -2z1 + z2 … 2 z1 + z2 … 6 z1 … 4 z1, z2 Ú 0

(a) Solve the problem graphically.

(b) Add slacks z3, z4, and z5 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).