Following are three simplex matrices in various stages of the simplex method solution of a maximization problem: Identify the matrix for which multiple solutions exist: Circle the pivot and specify all row opera- tions with that pivot that are needed to find a sec ond solution. (6) Identify the matrix for which no solution exists Explain how you can tell there is no solution. (c) For the remaining matrix, find the basic feasible solution. Use the variables x1,*2 the slack variables $1, $2, and the objective function f and tell whether these values give the optimal solu- tion. If they do not, identify the next pivot
10 50
12 20 40 170
40 15 60 220
