1. Solve the following linear programmne using the 2-phase simplex algorithm. You should give the initial tableau and each further tableau produced during the exe- cution of the algorithm. If the program has an optimal solution, give this solution and state its objective value. If it does not have an optimal solution, say why. maximize x1-2x2+x3 - 4x4 subject to 2x1 + x2 - 2x3 x4 ≥ 1, 5x1 x2 2x1 - x3x4 ≤ -1, x2 x3 - 3x4 2, - x1, x2, x3, x4 ≥ 0. 2. Apply the first phase of the 2-phase simplex algorithm to the following linear pro- gramme giving the initial tableau and each further tableau produced. Give the starting tableau for the second phase if there is one. 2x1 + x2+3x3 x2-x32, maximize subject to x13x2+2x3 ≥ 3, 2x12x2 x3 = 4, x1, x2, x3 0.

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter9: Systems Of Equations And Inequalities
Section9.3: Systems Of Inequalities
Problem 19E
icon
Related questions
Question
Highlight rows and columns please
1. Solve the following linear programmne using the 2-phase simplex algorithm. You
should give the initial tableau and each further tableau produced during the exe-
cution of the algorithm. If the program has an optimal solution, give this solution
and state its objective value. If it does not have an optimal solution, say why.
maximize x12x2 x3 - 4x4
-
subject to 2x1 + x22x3x4≥ 1,
5x1 + x2 x3 - x4 ≤ -1,
2x1
-
x2 x3 - 3x4 2,
x1, x2, x3, x4≥ 0.
2. Apply the first phase of the 2-phase simplex algorithm to the following linear pro-
gramme giving the initial tableau and each further tableau produced. Give the
starting tableau for the second phase if there is one.
maximize
2x1 + x2+3x3
subject to
x2-x32,
x13x2+2x3 ≥ 3,
2x12x2 x3 = 4,
x1, x2, x3 0.
Transcribed Image Text:1. Solve the following linear programmne using the 2-phase simplex algorithm. You should give the initial tableau and each further tableau produced during the exe- cution of the algorithm. If the program has an optimal solution, give this solution and state its objective value. If it does not have an optimal solution, say why. maximize x12x2 x3 - 4x4 - subject to 2x1 + x22x3x4≥ 1, 5x1 + x2 x3 - x4 ≤ -1, 2x1 - x2 x3 - 3x4 2, x1, x2, x3, x4≥ 0. 2. Apply the first phase of the 2-phase simplex algorithm to the following linear pro- gramme giving the initial tableau and each further tableau produced. Give the starting tableau for the second phase if there is one. maximize 2x1 + x2+3x3 subject to x2-x32, x13x2+2x3 ≥ 3, 2x12x2 x3 = 4, x1, x2, x3 0.
Expert Solution
steps

Step by step

Solved in 6 steps with 29 images

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

please can you do question 2 aswell. Thank you

2. Apply the first phase of the 2-phase simplex algorithm to the following linear pro-
gramme giving the initial tableau and each further tableau produced. Give the
starting tableau for the second phase if there is one.
maximize
2x1 + x2 + 3x3
subject to
x2-x32,
x13x2+2x3 ≥ 3,
2x12x2+3 = 4,
x1, x2, x3 0.
Transcribed Image Text:2. Apply the first phase of the 2-phase simplex algorithm to the following linear pro- gramme giving the initial tableau and each further tableau produced. Give the starting tableau for the second phase if there is one. maximize 2x1 + x2 + 3x3 subject to x2-x32, x13x2+2x3 ≥ 3, 2x12x2+3 = 4, x1, x2, x3 0.
Solution
Bartleby Expert
SEE SOLUTION
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning