At any iteration of the solution algorithm for a minimization problem, the simplex tableau is given below: Basic X1 X2 S2 S3 Solution Si Z 0 0 0 -20 -5 240 Si 0 0 1 -4 1 0 X2 0 1 0 3 -1 1 X1 1 0 0 2 1 12 Please choose the correct option below. O a. The solution is not optimal and x2 is the leaving variable. O b. The solution is not optimal and s2 is the entering variable. O c. The solution is optimal with Z-value =240 and xl = 12 and x2 = 1. O d. x1, x2 and s3 are the basic variables. O e. The solution is optimal with 2-value = 240 and xl = 8 and x2 = 12. = At any iteration of the solution algorithm for a minimization problem, the simplex tableau is given below: Basic X1 X2 Si S2 S3 Solution Z 5 0 0 -20 0 100 Si 2 0 1 -4 0 0 X2 -1 1 0 3 0 2 S3 0 0 0 2 1 12 Please choose the correct option below. a O a. There is a redundant constraint in the problem. O b. The solution can be made infinitely large without violating any of its constraints. O c. The solution is optimal with Z-value =100 and xl = 0 and x2 = 2. Od. The problem has alternative optimal solutions. Oe. The solution is not optimal and s2 is the entering variable. When using a general LP model for transportation problems, if there are 4 sources and 3 destinations, which of the following statements is true? O a. There are typically 4 decision variables and 3 constraints. O b. There are typically 12 decision variables and 12 constraints. O c. There are typically 7 decision variables and 7 constraints. O d. There are typically 12 decision variables and 3 constraints. Oe. There are typically 12 decision variables and 7 constraints. Because the operations management model requires that parameters are known with certainty, sensitivity analysis is not used in practical, real-world applications of linear programming O a. TRUE O b. FALSE The linear programming transportation model allows us to solve problems where supply does not equal demand. O a. TRUE O b. FALSE