Question

Solve the following LP problem using the simplex algorithm for maximum tableaus:

Maximize:

f(x1, x2, x3) = x₁ + 2x2 + 2x3

subject to x₁+2x2 + 2x3 ≤-4

2x1 + 3x3 ≤5

2x1- x₂ + x3 <-4

x1, x2, x3 > 0