Formulate the dual problem for the following linear programming model. 1. Minimize: C = 10x1 + 8x2 + 12x3 Subject to: 5xı +3x2 + 6x3 < 153 Maximize: P = 2x1 + x2+ x3 < 50 Subject to: x1, x2, X3 2 0
Formulate the dual problem for the following linear programming model. 1. Minimize: C = 10x1 + 8x2 + 12x3 Subject to: 5xı +3x2 + 6x3 < 153 Maximize: P = 2x1 + x2+ x3 < 50 Subject to: x1, x2, X3 2 0
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
Concept explainers
Equations and Inequations
Equations and inequalities describe the relationship between two mathematical expressions.
Linear Functions
A linear function can just be a constant, or it can be the constant multiplied with the variable like x or y. If the variables are of the form, x2, x1/2 or y2 it is not linear. The exponent over the variables should always be 1.
Question
What is the solution?
![Name:
Date:
Score:
Section Exercise 4.2
Formulate the dual problem for the following linear programming model.
1. Minimize: C = 10x1 + 8x2+ 12x3
Subject to: 5x1 + 3x2 + 6x3 < 153
%3D
Maximize: P =
2x1 + x2+ x3 < 50
Subject to:
X1, x2, x3 20
M =
M
2. Maximize: P = 40x1 + 20x2
Subject to:
Minimize: C=
X2<10
Subject to:
X1 +
x2<18
2r1 + 5x2 <60
3x1 + x2<44
x1, x2 20
%3D
M =
Maximize: P =
3. Minimize: C = 12x1 + 6x2+ 14x3
Subject to: 2x1 + 3x2 2 12
x1 +4x3 = 16
3x1 + x3< 23
%3D
Subject to:
x1, x2, x32 0
M =
M =
Chapter 4: Duality and Sensitivity Analysis
Page 117
TIH](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F502b77e6-597b-404b-9547-e7970a71f395%2Fcd021a95-10dc-42c1-a4a9-1605d9c24629%2F57jbz8g_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Name:
Date:
Score:
Section Exercise 4.2
Formulate the dual problem for the following linear programming model.
1. Minimize: C = 10x1 + 8x2+ 12x3
Subject to: 5x1 + 3x2 + 6x3 < 153
%3D
Maximize: P =
2x1 + x2+ x3 < 50
Subject to:
X1, x2, x3 20
M =
M
2. Maximize: P = 40x1 + 20x2
Subject to:
Minimize: C=
X2<10
Subject to:
X1 +
x2<18
2r1 + 5x2 <60
3x1 + x2<44
x1, x2 20
%3D
M =
Maximize: P =
3. Minimize: C = 12x1 + 6x2+ 14x3
Subject to: 2x1 + 3x2 2 12
x1 +4x3 = 16
3x1 + x3< 23
%3D
Subject to:
x1, x2, x32 0
M =
M =
Chapter 4: Duality and Sensitivity Analysis
Page 117
TIH
![Name:
Date:
Score:
Section Exercise 4.2A
Solve the primal problem using duality and determine the primal and dual solution.
1. Maximize: P 8x1 + 6x2
Subject to:
%3D
Minimize: C =
2x23
2x1 +x254
Subject to:
4xn S8
x1, x2 20
Solution:
Tableau 1
BV
yi
y2
ya
S1
S2
RHS
P
Tableau 2
BV
y1
y2
ys
S1
S2
RHS
Tableau 3
BV
y2
y3
Si
S2
P
RHS
yi
Si =
Dual Solution: yı =
%3D
S2 =
Primal Solution: x1D
Page 119
Chapter 4: Duality and Sensitivity Analysis](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F502b77e6-597b-404b-9547-e7970a71f395%2Fcd021a95-10dc-42c1-a4a9-1605d9c24629%2Fkeol45k_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Name:
Date:
Score:
Section Exercise 4.2A
Solve the primal problem using duality and determine the primal and dual solution.
1. Maximize: P 8x1 + 6x2
Subject to:
%3D
Minimize: C =
2x23
2x1 +x254
Subject to:
4xn S8
x1, x2 20
Solution:
Tableau 1
BV
yi
y2
ya
S1
S2
RHS
P
Tableau 2
BV
y1
y2
ys
S1
S2
RHS
Tableau 3
BV
y2
y3
Si
S2
P
RHS
yi
Si =
Dual Solution: yı =
%3D
S2 =
Primal Solution: x1D
Page 119
Chapter 4: Duality and Sensitivity Analysis
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
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](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Mathematics For Machine Technology](https://www.bartleby.com/isbn_cover_images/9781337798310/9781337798310_smallCoverImage.jpg)
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
![Basic Technical Mathematics](https://www.bartleby.com/isbn_cover_images/9780134437705/9780134437705_smallCoverImage.gif)
![Topology](https://www.bartleby.com/isbn_cover_images/9780134689517/9780134689517_smallCoverImage.gif)