Use the Simplex Algorithm to solve the following 2-D Linear Programming Problem: Maximize x + 4y subject to: x + y < 8 x -3y > 0 х +3у < 10 x > 0, y > 0 This LPP was solved geometrically in Homework III #3. Depict your elementary operations in the usual manner (and in the usual place); don't forget to state clearly at the end the solution to the LPP.

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

Hello. Need help with this practice question.

2. Use the Simplex Algorithm to solve the following 2-D Linear Programming Problem:
Maximize x + 4y subject to:
x + y < 8
x -3y > 0
x +3y < 10
x > 0, y 2 0
This LPP was solved geometrically in Homework III #3. Depict your elementary operations in
the usual manner (and in the usual place); don't forget to state clearly at the end the solution
to the LPP.
Transcribed Image Text:2. Use the Simplex Algorithm to solve the following 2-D Linear Programming Problem: Maximize x + 4y subject to: x + y < 8 x -3y > 0 x +3y < 10 x > 0, y 2 0 This LPP was solved geometrically in Homework III #3. Depict your elementary operations in the usual manner (and in the usual place); don't forget to state clearly at the end the solution to the LPP.
Expert Solution
Step 1

Given the LPP, Max x+4ysubject tox+y8x-3y0x+3y10x0,y0

 

Converting the problem into canonical formMax z=x+4y+0s1+0s2+0s3-MA1subject to x+y+s1                        =8x-3y     -s2       +A1  =0x+3y             +s3         =10

Step 2

Iteration-1

  Cj 1 4 0 0 0 -M  
B CB XB x y s1 s2 s3 A1 Min ratioxBx
s1 0 8 1 1 1 0 0 0 81=8
A1 -M 0 1 -3 0 -1 0 1 01=0
s3 0 10 1 3 0 0 1 0 101=10
z=0   zj -M 3M 0 M 0 -M  
    zj-cj -M-1 3M-4 0 M 0 0  

The most negative is -M-1 and hence the entering variable is x while the minimum ratio is 0 and hence the leaving variable is A1.

We perform the following operations, 

R1R1-R2R3R3-R2

Step 3

Iteration-2

  Cj 1 4 0 0 0  
B CB XB x y s1 s2 s3 Min ratioxBy
s1 0 8 0 4 1 1 0 84=2
x 1 0 1 -3 0 -1 0 ---
s3 0 10 0 6 0 1 1 106=1.667
z=0   zj 1 -3 0 -1 0  
    zj-cj 0 -7 0 -1 0  

The most negative is -7 and hence the entering variable is y while the least ratio is 1.667 and hence the leaving variable is s3.

We perform the following operations, 

R3R36R1R1-4R3R2R2+3R3

steps

Step by step

Solved in 5 steps

Blurred answer
Knowledge Booster
Research Design Formulation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
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,