QUESTION 7 If during the last iteration of the simplex method the entry corresponding to the non-basic in C-Z row is zero, then LP problem has: Multiple Solutions Infeasible solution No solution Unbounded solution QUESTION 8 In a minimization problem a negative shadow price for a constraint means the objective function value will decrease, as the right-hand side decreases. the objective function value will decrease, as the right-hand side increases. the objective function value will increase, as the right-hand side decreases the objective function value will increase, as the right-hand side increases. QUESTION 9 When we obtain multiple optimal solutions for an LP problem using the simplex method We have number of basic variables less than the number of zeros in c-z row We have Zeros number greater than the number of the decision variables We have zero(s) in c-z row for some of basic variables in the simplex table We have number of zeros in Z-Row more than the number of constraints in the model