Consider the following linear optimization model: (P) min 2x1 +4x2+ 10x3 + 15x4 s.t. -x1 + x2 + x3 + 3x4 ≥ 1 x1x2 + 2x3 + x4 ≥ 1 X1, X2, x3, x4 ≥ 0. 1. Write a Phase-I model for (P). Add the slack/excess variables first (call them x5, x6) and then add two artificial variables. 2. Solve the Phase-I model using simplex. The starting basis of your Phase-I model should be compose of the two artificial variables. When selecting variables to enter the basis, always select the eligible variable with smallest index. When selecting variables to leave the basis, always select the eligible variable with smallest index. (When providing an answer to this problem, report (at least) the simplex dictionary obtained at each iteration, and state what variables are entering/leaving the basis.) At the conclusion of the algorithm, present the optimal solution you found.
Consider the following linear optimization model: (P) min 2x1 +4x2+ 10x3 + 15x4 s.t. -x1 + x2 + x3 + 3x4 ≥ 1 x1x2 + 2x3 + x4 ≥ 1 X1, X2, x3, x4 ≥ 0. 1. Write a Phase-I model for (P). Add the slack/excess variables first (call them x5, x6) and then add two artificial variables. 2. Solve the Phase-I model using simplex. The starting basis of your Phase-I model should be compose of the two artificial variables. When selecting variables to enter the basis, always select the eligible variable with smallest index. When selecting variables to leave the basis, always select the eligible variable with smallest index. (When providing an answer to this problem, report (at least) the simplex dictionary obtained at each iteration, and state what variables are entering/leaving the basis.) At the conclusion of the algorithm, present the optimal solution you found.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Please help answer one or two

Transcribed Image Text:Consider the following linear optimization model:
(P)
min 2x1 +4x2+ 10x3 + 15x4
s.t. x1 + x2 + x3 + 3x4 ≥ 1
x1x2 + 2x3 + x4 ≥ 1
X1, X2, X3, X4 ≥ 0.
1. Write a Phase-I model for (P). Add the slack/excess variables first (call them x5, x6) and then add
two artificial variables.
2. Solve the Phase-I model using simplex. The starting basis of your Phase-I model should be compose
of the two artificial variables. When selecting variables to enter the basis, always select the eligible
variable with smallest index. When selecting variables to leave the basis, always select the eligible
variable with smallest index. (When providing an answer to this problem, report (at least) the simplex
dictionary obtained at each iteration, and state what variables are entering/leaving the basis.) At
the conclusion of the algorithm, present the optimal solution you found.
3. Write the simplex dictionary of (P) associated with the optimal basis you identified in Part 2.
4. Starting from the simplex dictionary in Part 3, find an optimal solution to (P) using simplex. Use
the same pivoting rules and present your work in the same format as in Part 2.
5. Write the dual of (P).
6. Solve the dual model using the graphical solution method.
7. Solve (P) by using the complementary slackness relations from the optimal dual solution you obtained
in Part 6.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 5 images

Recommended textbooks for you

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

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…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

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…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,

