Solve the following linear programming model by the Simplex Method: Maximum (Z) = 3X1 + 5X2 ---------- (OF) Subject to: X1 + 6X2 < 180 --------- (1) 3X1 + 2X2 s 240 --------- (2) X1, X2 > 0 1. Prepare the initial (first) table of Simplex 2. Determine the Entering Variable (EV), Leaving Variable (LV) and the pivot number 3. Is the above solution represent an optimal solution? If not, prepare the Second table of simplex ONLY

College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter6: Linear Systems
Section6.8: Linear Programming
Problem 33E
icon
Related questions
Question

please the answer

Solve the following linear programming model by the
Simplex Method:
Maximum (Z) = 3X1 + 5X2 ----------- (OF)
Subject to: X1 + 6X2 < 180 --------- (1)
3X1 + 2X2 s 240 --------- (2)
X1, X2 > 0
1.
Prepare the initial (first) table of Simplex
Is the above solution represent an optimal solution? If not, prepare the Second table of simplex ONLY
3.
2.
Determine the Entering Variable (EV), Leaving Variable (LV) and the pivot number
Transcribed Image Text:Solve the following linear programming model by the Simplex Method: Maximum (Z) = 3X1 + 5X2 ----------- (OF) Subject to: X1 + 6X2 < 180 --------- (1) 3X1 + 2X2 s 240 --------- (2) X1, X2 > 0 1. Prepare the initial (first) table of Simplex Is the above solution represent an optimal solution? If not, prepare the Second table of simplex ONLY 3. 2. Determine the Entering Variable (EV), Leaving Variable (LV) and the pivot number
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning