Q4. Solve the following linear programming problem using graphical method. Comment on the nature of the solution. Maximise Z = 4x + 3x₂ Subject to 2x+3x₂ <6 -3x₁ + 2x₂ <3 2x2 55 2x₁ + x₂ 54 21,9×240

Solve the linear programming problem using the simplex method. Maximize z = 2x₁ +9x2 subject to 5Xq+X, 550 9x1 + 2x2 ≤70 x1 + x2 ≤60 X1, X2 ≥0. Select the correct choice below and, if necessary, fill in the answer box to complete your choice. OA. The maximum is z = when X1 = , X₂ = S1 = , S2 = and S3= B. There is no maximum solution for this linear programming problem.

Simplex method and elementary row of operations if necessary. Please show steps.

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.