QUESTION 11 If the optimality has been reached but the artificial variable is still in the basis then the LP problem has Multiple Solutions Degenrate Problem Infeasibility Unbounded solution QUESTION 12 Which of the following statements is true? Changing the RHS of a constraint changes its slope. A less than or equal to constraint with positive slack in the optimal solution will always have an infinite allowable decrease for the RHS Increasing the RHS of a less than or equal to constraint will eventually make shadow price equal to zero. An optimal solution will never use up all of the resources available. QUESTION 13 In simplex method if we face Degeneracy or/and cycling then: we will face cycling case if we have a degeneracy case in the simplex solution We may see Cycling if we have degeneracy case We may have a degeneracy in the simplex solution if we have cycling in the solution. We have always a cycling case when we have a degenerate solution