Problem 2 X: X0 B X=0 X- A X=0 D o X (Simplex fun) The constraints for a two-variable LP are shown in the figure. The slack variables corresponding to a constraint is shown above the constraint. The points O, A, B, C, and D are the corner points defining the feasible region. (a) Specify the sets of basic and non-basic variables corresponding to O. A, B. and C. If a corner point has more than one possible basis, specify all the possibilities. (9 points) (b) Suppose the simplex starts at O and reaches B after two iterations. Specify the entering and leaving variables in each iteration. (8 points) c) If the simplex method starts at C what is the minimum number of iterations it will take to reach O? Justify your answer (3 points) Problem 2 X: X0 B X=0 X- A X=0 D o X (Simplex fun) The constraints for a two-variable LP are shown in the figure. The slack variables corresponding to a constraint is shown above the constraint. The points O, A, B, C, and D are the corner points defining the feasible region. (a) Specify the sets of basic and non-basic variables corresponding to O. A, B. and C. If a corner point has more than one possible basis, specify all the possibilities. (9 points) (b) Suppose the simplex starts at O and reaches B after two iterations. Specify the entering and leaving variables in each iteration. (8 points) c) If the simplex method starts at C what is the minimum number of iterations it will take to reach O? Justify your answer (3 points)