(15) Problem #2 The following tableau represents a specific simplex iteration for a minimization problem. Z X1 X2 X3 S; S2 S3 RHS 1 0 a 0 -3 -5 0 15 000 1 1 0 b 3 0 1 d 0 1 2 0 5 0 0 -3 0 -2 6 1 c 1) make the current feasible solution optimal 2) allow X to enter the basis to improve the value of -3) indicate that the problem is unbounded. 4) indicate alternate optimal solutions. For problem #2 of Homework #7 I was not clear as what you should do. For each part of the problem, you should assign numerical values to a,b,c, and d that will satisfy the criterion. For example, since we are given a minimization LP, we would have to assign a negative number for a in part(1) since the solution is to be optimal. (15) Problem #2 The following tableau represents a specific simplex iteration for a minimization problem. Z X1 X2 X3 S; S2 S3 RHS 1 0 a 0 -3 -5 0 15 000 1 1 0 b 3 0 1 d 0 1 2 0 5 0 0 -3 0 -2 6 1 c 1) make the current feasible solution optimal 2) allow X to enter the basis to improve the value of -3) indicate that the problem is unbounded. 4) indicate alternate optimal solutions. For problem #2 of Homework #7 I was not clear as what you should do. For each part of the problem, you should assign numerical values to a,b,c, and d that will satisfy the criterion. For example, since we are given a minimization LP, we would have to assign a negative number for a in part(1) since the solution is to be optimal