Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
Solve the following linear program using the simplex algorithm. You should give the initial tableau and each further tableau produced during the execution 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. You should indicate the highlighted row and columns in each pivot step as well as the row operations you carry out. 1. maximize 2x13x25x3 + x4 subject to x1+x22x3 + x4 ≤ 2, 3x23x33x4 ≤ 6, 3x12x22x3 + x4 ≤7, X1, X2, X3, X4 ≥ 0 2. Suppose that we are carrying out the simplex algorithm on a linear program in standard inequality form (with 3 variables and 4 constraints) and suppose that we have reached a point where we have obtained the following tableau. Apply one more pivot operation, indicating the highlighted row and column and the row operations you carry out. What can you conclude from your updated tableau? X2 X3 S1 S2 S3 S4 x1 S1 -2 0 1 1 0 0 0 3 S2 3 0 -2 0 1 2 0 6 x2 1 1 -3 0 0 1 0 2 S4 -3 0 2 0 0 -2 -20 11 −1 1 4 00-40-8

Solve the following linear program using the simplex algorithm. You should give the initial tableau and each further tableau produced during the execution 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. You should indicate the highlighted row and columns in each pivot step as well as the row operations you carry out. 1. maximize 2x13x25x3 + x4 subject to x1+x22x3 + x4 ≤ 2, 3x23x33x4 ≤ 6, 3x12x22x3 + x4 ≤7, X1, X2, X3, X4 ≥ 0 2. Suppose that we are carrying out the simplex algorithm on a linear program in standard inequality form (with 3 variables and 4 constraints) and suppose that we have reached a point where we have obtained the following tableau. Apply one more pivot operation, indicating the highlighted row and column and the row operations you carry out. What can you conclude from your updated tableau? X2 X3 S1 S2 S3 S4 x1 S1 -2 0 1 1 0 0 0 3 S2 3 0 -2 0 1 2 0 6 x2 1 1 -3 0 0 1 0 2 S4 -3 0 2 0 0 -2 -20 11 −1 1 4 00-40-8

Advanced Engineering Mathematics
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
See similar textbooks
icon
Related questions
Question

question 1 please 

Solve the following linear program using the simplex algorithm. You should give the initial tableau and each further tableau produced during the execution 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. You should indicate the highlighted row and columns in each pivot step as well as the row operations you carry out. 1. maximize 2x13x25x3 + x4 subject to x1+x22x3 + x4 ≤ 2, 3x23x33x4 ≤ 6, 3x12x22x3 + x4 ≤7, X1, X2, X3, X4 ≥ 0 2. Suppose that we are carrying out the simplex algorithm on a linear program in standard inequality form (with 3 variables and 4 constraints) and suppose that we have reached a point where we have obtained the following tableau. Apply one more pivot operation, indicating the highlighted row and column and the row operations you carry out. What can you conclude from your updated tableau? X2 X3 S1 S2 S3 S4 x1 S1 -2 0 1 1 0 0 0 3 S2 3 0 -2 0 1 2 0 6 x2 1 1 -3 0 0 1 0 2 S4 -3 0 2 0 0 -2 -20 11 −1 1 4 00-40-8
Transcribed Image Text:Solve the following linear program using the simplex algorithm. You should give the initial tableau and each further tableau produced during the execution 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. You should indicate the highlighted row and columns in each pivot step as well as the row operations you carry out. 1. maximize 2x13x25x3 + x4 subject to x1+x22x3 + x4 ≤ 2, 3x23x33x4 ≤ 6, 3x12x22x3 + x4 ≤7, X1, X2, X3, X4 ≥ 0 2. Suppose that we are carrying out the simplex algorithm on a linear program in standard inequality form (with 3 variables and 4 constraints) and suppose that we have reached a point where we have obtained the following tableau. Apply one more pivot operation, indicating the highlighted row and column and the row operations you carry out. What can you conclude from your updated tableau? X2 X3 S1 S2 S3 S4 x1 S1 -2 0 1 1 0 0 0 3 S2 3 0 -2 0 1 2 0 6 x2 1 1 -3 0 0 1 0 2 S4 -3 0 2 0 0 -2 -20 11 −1 1 4 00-40-8
Expert Solution
steps

Step by step

Solved in 1 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,
SEE MORE TEXTBOOKS