Answer Happy

Problem 4. Consider the following linear optimization problem. Use the simplex algorithm to solve this problem. Some guidelines: Clearly indicate your steps, e.g., entering and leaving variables, some calculations, etc. ▪ To check your solution, note that you should end up with an objective function value of 11. maximize subject to 4x + 3y + 2z x + 2 ≤ 2 −x − y + z ≤1 x+y+z ≤ 3 x, y, z ≥ 0 Note: If you would like more practice with the simplex algorithm, see Chapter 2 of the textbook.