2 (a) Solve the following linear program graphically Identify the feasible region and the optimal solution. Plot the objective function as a double dashed line broken line (======) through the optimal point. Label the feasible extreme points starting with the feasible extreme point with coordinates closest to X1, X2] = [0, 0] as A, and continuing counter-clockwise for the other feasible extreme points. Minimize Z = 15 X1 - 15 X2 S. t. - 2X1 2 X1 2 X2 s 16 (1) 2 X2 s 16 X1 X2 < 15 X2 9 X1, X2 0 2 (b) Provide the optimal solution, X1, X2 and the optimal value of the objective function, L for problem 2 (a). 2 (c) For each feasible Extreme Point in Problem 2 (a), Complete the following table (add additional rows as needed): Point x1 x2 Optimal? (Y/N] Why? 0.0 0.0 0.0
2 (a) Solve the following linear program graphically Identify the feasible region and the optimal solution. Plot the objective function as a double dashed line broken line (======) through the optimal point. Label the feasible extreme points starting with the feasible extreme point with coordinates closest to X1, X2] = [0, 0] as A, and continuing counter-clockwise for the other feasible extreme points. Minimize Z = 15 X1 - 15 X2 S. t. - 2X1 2 X1 2 X2 s 16 (1) 2 X2 s 16 X1 X2 < 15 X2 9 X1, X2 0 2 (b) Provide the optimal solution, X1, X2 and the optimal value of the objective function, L for problem 2 (a). 2 (c) For each feasible Extreme Point in Problem 2 (a), Complete the following table (add additional rows as needed): Point x1 x2 Optimal? (Y/N] Why? 0.0 0.0 0.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
Question
![Problem 2
2 (a) Solve the following linear program graphically Identify the feasible region and the optimal solution. Plot the objective function as
a double dashed line broken line (==3===) through the optimal point. Label the feasible extreme points starting with the feasible extreme
point with coordinates closest to X1, X2] = [0, 0] as A, and continuing counter-clockwise for the other feasible extreme points.
Minimize Z = 15 X1
15 X2
S. t.
- 2X1
2 X1
2 X2 s 16
2 X2 s 16
X1
X2
315
X2
X1, X2 0
2 (b) Provide the optimal solution, X1, X2: and the optimal value of the objective function, Z. for problem 2 (a).
2 (c) For each feasible Extreme Point in Problem 2 (a), Complete the following table (add additional rows as needed):
Point
x1
Optimal? (YIN]
x2
Why?
00
0.0
00](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fded4d143-e6bc-43a7-af80-2ef19d02a5d5%2F0a702f92-3fa4-48b2-8788-48a5fed5be26%2F71zuh8_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Problem 2
2 (a) Solve the following linear program graphically Identify the feasible region and the optimal solution. Plot the objective function as
a double dashed line broken line (==3===) through the optimal point. Label the feasible extreme points starting with the feasible extreme
point with coordinates closest to X1, X2] = [0, 0] as A, and continuing counter-clockwise for the other feasible extreme points.
Minimize Z = 15 X1
15 X2
S. t.
- 2X1
2 X1
2 X2 s 16
2 X2 s 16
X1
X2
315
X2
X1, X2 0
2 (b) Provide the optimal solution, X1, X2: and the optimal value of the objective function, Z. for problem 2 (a).
2 (c) For each feasible Extreme Point in Problem 2 (a), Complete the following table (add additional rows as needed):
Point
x1
Optimal? (YIN]
x2
Why?
00
0.0
00
Expert Solution
Step 1
The given minimization problem is:
Subject to:
(a).
Consider the equations:
Therefore the feasible region can be drawn as:
Step by step
Solved in 3 steps with 2 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,
