1. A maximiration linear peogramming problem has been solved by the aimpies metbod and the simples table is: Which of the following is an optimal point indicated by the table? Note: x1,x2,x3 are dee varables and u,v, and w are alack, surplus, or artificial variables. (12 pointu) a) (x1,x2,x2)=(8,3,2) b) (x1,x2,x2)=(8,2,3) e) (x1,x2,x3)=(0,8,2) d) (x3,x2,x3)=(0,0,2) c) None of there 4. Affer completing the simplex method, the solution can be read from the final simplex table. variables are Not automafically act equal to zero? (4 points) a) Slack Variables b) Non-basic Variables c) Independeat Variables d) Dependent Variables e) Bavic Variables: 5. A solution of the problem is said to be degenerate if: (5 points) a) If x-row value for one or more nop-basic variable is zero in the optimai tableau b) If the valoe of at least one havic variable becotnes zero c) If there as no positive minimum tatio or all entries of pivot column are negative or zero. d) If at least one artificial variable is positive in the optimum iteration c) None of these 6. One constraint for a standurd maximization problem is: x0.2(x+y) What is the correct way to rearrange this as an equation (inclading a slack srirable s) before enteri a) 0.8x+0.2y+ d) c) None of the above