show all work
Show transcribed image text 5. (15 pts) Use simplex method to solve the following linear programming problem Maximize Z = 2×1 + x2 + x3 subject to 2i 3×2-3 9 2x +324 r1 1, 2, 330 o tho follouring linear programming
5. (15 pts) Use simplex method to solve the following linear programming problem Maximize Z = 2×1 + x2 + x3 subject to 2i 3×2-3 9 2x +324 r1 1, 2, 330 o tho follouring linear programming





