Problem 6. (20 points) Consider the following linear program Subject to 8x 2xz+ 3x S 200 (Resource 1) S 100 (Resource 2) s 50 (Resource 3) S 20 (Resource 3) 4xi +3x 2x + x3 x20 1,, 3). Let x, xs, xs and xdenote the slack variables for the first through fourth constraints, respectively. Suppose that after some number of iterations of the simplex method a portion of the current simplex tableau is as follows Basic Variables No. RHS 9/4 1/2 TI 14 1/2 -3/8 1/4 T6 a) b) c) Use the fundamental insight we discussed in class to identify the missing numbers in the current simplex tableau. Indicate which of these missing numbers would be generated by the revised simplex method in to order to perform the next iteration. Identify the defining equations of the corner-point feasible solution corresponding to the basic feasible solution in the curent simplex tableau. Problem 6. (20 points) Consider the following linear program Subject to 8x 2xz+ 3x S 200 (Resource 1) S 100 (Resource 2) s 50 (Resource 3) S 20 (Resource 3) 4xi +3x 2x + x3 x20 1,, 3). Let x, xs, xs and xdenote the slack variables for the first through fourth constraints, respectively. Suppose that after some number of iterations of the simplex method a portion of the current simplex tableau is as follows Basic Variables No. RHS 9/4 1/2 TI 14 1/2 -3/8 1/4 T6 a) b) c) Use the fundamental insight we discussed in class to identify the missing numbers in the current simplex tableau. Indicate which of these missing numbers would be generated by the revised simplex method in to order to perform the next iteration. Identify the defining equations of the corner-point feasible solution corresponding to the basic feasible solution in the curent simplex tableau