1) How to justify if there is a tie for the minimum b-ratio at some iteration of the phase II simplex algorithm, then the next basic feasible solution is degenerate. I have no idea how to justify it. Please give me some direction 2) Max. z = transpose of C * the vector x s.t. Ax less or = b & X bigger or = to 0 Suppose d belong in R^n satisfies Ad=0 and d bigger or equal to 0 a) Prove that if u belongs to R^n is a feasible solution of P, then so is u+td for all 0 less than or equal to t belongs to R. b) Use part (a) to prove that if the transpose of C * d >= 0, the P is unbounded. I think the big problem here is that I do not know how to approach part a. please give some insight for how to at least begin to solve this problem? Thank you! I appreciate your time!