Consider the linear program min 5z1 + 6z2 s.t. z1 + z2 3 3z1 + 2z2 8 0 z1 6 0

Consider the linear program min 5z1 + 6z2 s.t. z1 + z2 Ú 3 3z1 + 2z2 Ú 8 0 … z1 … 6 0 … z2 … 5

(a) Solve the problem graphically.

(b) Add slacks z3 and z4 to place the model in standard form for a lower- and upperbounded simplex.

(c) Apply lower- and upper-bounded simplex Algorithm 5D to compute an optimal solution to your standard form starting with all slacks basic and original variables nonbasic at their upper bounds.

(d) Plot your progress in part

(c) on the graph of part (a).