Math Problem Statement
For the following LP model, we have obtained the following tableau when we apply the Simplex method to solve it. In the tableau, s_j is the slack variable added in to the jth constraint. Maximize z= 〖2x〗_1+4x_2+3x_3 s.t. 3x_1+4x_2+ 2x_3≤60 2x_1+x_2+2x_3 ≤40 x_1+3x_2+2x_3≤80 x_1,x_2,x_3≥0 z x_1 x_2 x_3 s_1 s_2 s_3 RHS row 0 1 11/6 0 0 5/6 2/3 0 230/3 row 1 0 1/3 1 0 1/3 -1/3 0 20/3 row 2 0 5/6 0 1 -1/6 2/3 0 50/3 Row 3 0 -5/3 0 0 -2/3 -1/3 1 80/3 Have we got an optimal solution already? If so, which variables are basic variables? What is the inverse of the basis matrix (B-1)? What is the objective function value corresponding to the current solution? (用汉语解题)
Solution
Ask a new question for Free
By Image
Drop file here or Click Here to upload
Math Problem Analysis
Mathematical Concepts
Linear Programming
Simplex Method
Optimization
Formulas
Objective function
Constraint equations
Simplex tableau
Theorems
-
Suitable Grade Level
Undergraduate level
Related Recommendation
Solve Linear Programming Using Simplex and Gomory Cutting Plane Method
Implementing the Simplex Method for Linear Programming
Using Simplex Method to Solve Linear Programming Problems
Understanding a Simplex Method Tableau for Linear Programming
Solution for a Multidimensional Linear Programming Problem