Answer Happy

Question 1 I am solving a minimization LP by the simplex method. At a given iteration, the basic variables are 11, 12, and 25, while the non-basic variables are 13, 14, and 26. Let AB be the matrix of constraint coefficients corresponding to the basic variables, b be the right-hand-side vector, and A be the column of constraint coefficients corresponding to the jth variable. Suppose that Ag+b= AR'A = -2 AZ'A' = 0 -2 -3 and AR'A + 1. Suppose also that the reduced costs of 13, 14 and 16 are -3, 1 and -5, respectively. Use Bland's rule for pivoting. (a) (2pt) State the entering and leaving variables (if any). (6) (3pt) What kind of pivot is it? Circle the correct choice, below. degenerate detect unboundedness move to a new extreme point If your answer is "moved to a new extreme point”, give the values of all the variables at the new extreme point. 2. Suppose instead that the reduced costs of 13, 14 and 16 are 0, 1 and -3, respectively. Use Bland's rule for pivoting. (a) (2pt) State the entering and leaving variables (if any). a (6) (3pt) What kind of pivot is it? Circle the correct choice, below. degenerate detect unboundedness move to a new extreme point If your answer is "moved to a new extreme point”, give the values of all the variables at the new extreme point.