Solve the following 2-dimensional linear programming problem graphically: maximize: 3x1 + 4x2 subject to: 0₁ ≤ 6 0≤x₂ ≤4 x1 + x₂ ≤ 6 Please select file(s) Select file(s)

Use the simplex method to solve the linear programming problem. Maximize: z = 2x₁ + x2 subject to: x₁ + 4x₂ ≤ 12 2x₁ + 6x₂ ≤ 4 X₁ + 2x2 ≤ 4 with x₁ ≥ 0, x₂ ≥ 0. Select the correct choice below and, if necessary, fill in the answer box to complete your choice. A. The maximum is when x₁ = x₂ = , S₁ = S2 = and S3 = B. There is no maximum solution to this linear programming problem.