Use the simplex method to solve the linear programming problem.Convert the constraints intolinear equations by using slack variables.8) Maximize z = 2x1 + 8x2Subject to: x1 + 6x2 ≤ 157x1 + 5x2 ≤ 25x1 ≥ 0, x2 ≥ 0a) Convert the constraints into linear equations by using slack variables.b) Write the initial simplex tableau using slack variables.c) Find the pivot in the simplex tableau.d) Perform the pivoting for the pivot found in part (c).e) Repeat parts (c) and (d) if necessary to find another pivot.f) Write the basic solution for the simplex tableau determined by setting the nonbasicvariables equal to 0.

Answered: Image /qna-images/answer/2c0519e4-d8b1-47e7-a475-1f9c29fa7932.jpg

Use the simplex method to solve the linear programming problem.Convert linear equations by using slack variables. 8) Maximize z = 2x1 + 8x2 Subject to: x₁ + 6x2 ≤ 15 7x1 + 5x2 ≤ 25 x1 ≥ 0, x2 ≥ 0 a) Convert the constraints into linear equations by using slack variable b) Write the initial simplex tableau using slack variables. c) Find the pivot in the simplex tableau. d) Perform the pivoting for the pivot found in part (c). e) Repeat parts (c) and (d) if necessary to find another pivot. f) Write the basic solution for the simplex tableau determined by settim variables equal to 0.