Consider the linear program max 9 y1 + y2 s.t. -2y1 + y2 2 y2

Consider the linear program max 9 y1 + y2 s.t. -2y1 + y2 Ú 2 y2 … 1 y1, y2 Ú 0

(a) Show graphically that the model is infeasible.

(b) Add slacks and artificials y3,c, y5 to setup the model for Phase I of Algorithm 5B.

(c) Apply rudimentary simplex Algorithm 5A to this Phase I problem to establish that the original model is infeasible.