Search for question
Question
5. Solve the following LP problem using the simplex algorithm for maximum tableaus:
Maximize:
f(x₁, x₂) = 3x₁ + x₂
subject to
x1- x₂ ≤ −1
-x₁- x₂ ≤-3
2x1- x₂ ≤2
x1, x2 >0
Maximize:
f(x₁, x₂) = 3x₁ + x₂
subject to
x1- x₂ ≤ −1
-x₁- x₂ ≤-3
2x1- x₂ ≤2
x1, x2 >0
