Linear Programming: The Dual Simplex Method
Problem 18
Do a, c,d. Solve part (c) only. For part (a) and (d), just write down the initial table
16. Continue the argument of Exercise show ullUUullull result from application of the dual simplex method. easuot 17. Suppose a tableau contains a row with all nonnegative entries except for in the resource column. Explain why the tableau corresponds to a proble feasible set. 18. Use the final simplex tableau x 1 x 2 x X4 X5 X6 x 0 1 4 -t 0 2 X6 0 0 -3 1 0 0 0 2 for the LP problem Maximize z 2x1 x2 x3 Subject to x1 2x2 x3 4 3x1 x x3 S 2 4x1 x2 2x3 s 8 xi 0, 1 is 3 to solve this problem given the additional constraint (a) -x1 3x2 2x3 s 1 (b) 2x1 2x2 x3 s 5 (c) 2x1 x2 x3 24 (d) 2x1 3x2 x3 4 19. Use the final simplex tableau x 1 x x x
Show transcribed image text 16. Continue the argument of Exercise show ullUUullull result from application of the dual simplex method. easuot 17. Suppose a tableau contains a row with all nonnegative entries except for in the resource column. Explain why the tableau corresponds to a proble feasible set. 18. Use the final simplex tableau x 1 x 2 x X4 X5 X6 x 0 1 4 -t 0 2 X6 0 0 -3 1 0 0 0 2 for the LP problem Maximize z 2x1 x2 x3 Subject to x1 2x2 x3 4 3x1 x x3 S 2 4x1 x2 2x3 s 8 xi 0, 1 is 3 to solve this problem given the additional constraint (a) -x1 3x2 2x3 s 1 (b) 2x1 2x2 x3 s 5 (c) 2x1 x2 x3 24 (d) 2x1 3x2 x3 4 19. Use the final simplex tableau x 1 x x x