QUESTION 3 Suppose we are solving a maximization linear program and we arrive at the following simplex tableau in which some of the numbers have been replaced by constants p. 4., , and t. z X1 X2 X3 X4 X5 X5 RHS Row 0 1 P OG 0 24 Row 1 0 3 14 Row 2 0 1 0 -2 11 02 s Suppose the current basic solution is also a basic feasible solution, thus, this implies some conditions must be satisfied by p, q, r, s, and t. In addition to these conditions required to ensure the current basic solution is a basic feasible solution, what conditions must be satisfied for the current basic solution to be an optimal solution to the linear program? (Hint: You may need to refer to a previous lesson to review this information) Os 20, 120 Op 20,920,120 OPS0.450.50 Ossot 50 QUESTION 4 Suppose we are solving a maximization linear program and we arrive at the following simplex tableau in which some of the numbers have been replaced by constants p. 9. andr. Z X1 X2 X3 X4 X5 RHS Row 0 1 2 09024 Row 1 0 3 1 4 0 2 10 Row 20 10211 2 Suppose the current tableau is an optimal tableau, thus, this implies some conditions must be satisfied by p, q, and r. In addition to these conditions required to ensure the current tableau is optimal, what conditions must be satisfied for the linear program to have alternative optimal solutions? We must have p= 0 We must have at least one of (p. 9. equal to 0 O We must haverso O We must have g = 0 We must have all of (p. 9.) equal to 0