Use the simplex method to solve the linear programming problem. Maximize z = x₁ + 3x2 + x3 + 2x4 subject to 2x₁ + x₂ + 5

[answerhappygod]

Use The Simplex Method To Solve The Linear Programming Problem Maximize Z X 3x2 X3 2x4 Subject To 2x X 5 1 (13.07 KiB) Viewed 33 times

Use the simplex method to solve the linear programming problem. Maximize z = x₁ + 3x2 + x3 + 2x4 subject to 2x₁ + x₂ + 5x3 + 6x4 ≤25 and 5x₁ + 3x₂ + 4x3 + x4 ≤60 with x₁ 20, x₂ 20, x3 ≥ 0, and x4 20. O A. Maximum is 36 when x₁ = 0, x₂ = 10, x3 = 0, x4 = 3 O B. Maximum is 60 when x₁ = 0, X₂ = 20, x3 = 0, x4 = 0 O C. Maximum is 50 when x₁ = 0, x₂ = 0, x3 = 0, x4 = 25 O D. Maximum is 75 when x₁ = 0, X₂ = 25, x3 = 0, x4 = 0