. IS - 2 a - 1 24 B 4 0 0 1 0 0 0 0 0 4 1 1 1 0 0 Consider the following simplex tableau (corresponding to a minimization problem): Table: Simplex tableau 26 17 1 0 7 0 12 -2 08 5 All parts refer to the basic solution for the above tableau. In each case, give the most general answer possible conditions should be as succinct and necessary as possible. In each case express the answer in terms of equalities or inequalities involving one or more of the terms of 0,8,9,6,6, and 1) 1. Under what conditions on y is the current basic solution feasible and nondegenerate? 2. Under what conditions on v is the current basic solution feasible and degenerate? 3. Under what conditions on a, 8, and y is the current basic solution nondegenerate and optimal? 4. Assume that a, 8., and satisfy the conditions of Part 3. Write at least one additional condition for the problem to have multiple optimal solutions. 5. Assume > 0. Under what conditions on o, 8, and is the current basic solution optimal and the problem has a unique optimal solution? 6. Assume 20. Under what conditions on a and 8 can the simplex algorithm immediately and with a proof that the objective value in unbounded from below