need help solving **Title: Solving Linear Programming Problems Using the Simplex Method****Objective:**This module teaches you how to solve linear programming (LP) problems using the simplex method. Our goal is to find the optimal solution for a given LP problem.**Problem Statement:**We are given a linear programming problem where we need to maximize the objective function:\[ z = 2x_1 + 5x_2 \]This objective function is subject to the following constraints:1. \( 5x_1 + x_2 \leq 60 \)2. \( 5x_1 + 2x_2 \leq 80 \)3. \( x_1 + x_2 \leq 70 \)Additionally, the variables must satisfy the non-negativity constraints:\[ x_1, x_2 \geq 0 \]**Steps:**To find the optimal solution using the simplex method, follow these steps:1. **Formulate the Initial Simplex Tableau**: We convert the inequalities into equalities by adding slack variables. For instance: - \( 5x_1 + x_2 + s_1 = 60 \) - \( 5x_1 + 2x_2 + s_2 = 80 \) - \( x_1 + x_2 + s_3 = 70 \)2. **Set Up the Initial Tableau**: Construct the initial tableau with constraints and objective function.3. **Perform Pivot Operations**: Follow the rules of the simplex method to pivot and shift towards the optimal solution.4. **Iterate Until Optimal Solution is Found**: Continue pivoting until no further improvement to the objective function can be made.**Select the Correct Choice:**Based on applying the simplex method, you will either find the maximum value and corresponding values of \( x_1 \) and \( x_2 \), or determine that there is no maximum.**Options**:**A.** The maximum value is \[ \boxed{\hspace{30pt}} \] when \( x_1 = \boxed{\hspace{30pt}} \) and \( x_2 = \boxed{\hspace{30pt}} \). (Simplify your answers.)**B.** There is no maximum.By solving this problem using the simplex method, you will practice and reinforce your

Name: need help solving **Title: Solving Linear Programming Problems Using t
Uploaded: 2024-03-20T07:07:37.000Z
Channel: Bartleby
Description: need help solving **Title: Solving Linear Programming Problems Using the Simplex Method****Objective:**This module teaches you how to solve linear programming (LP) problems using the simplex method. Our goal is to find the optimal solution for a give