The following linear programming problem described the manufacturing two products (X, & X2) by using two raw materials (R1 & R2); Max. Z= 3X, + 4X2 Subject to: (Constraint of raw material R,) 2X1 + 3X2 s 1200 2X1 + X2s 1000 (Constraint of raw material R2) X2s 200 (Demand for product X2) X1 X2 2 0 1- By using the Algebraic Analysis, find whether a change in the right-hand side for constraint of raw material R2, (1000), and the current basis remains optimal. 2- Change this linear programming model to Dual Problem Model, and find the values of the variables and W by using the optimal simplex tableau which shown below. B.V. X1 X2 S2 S3 K X1 1 - 1/4 3/4 450 X2 0 1 1/2 - 1/2 100 S3 -1/2 1/2 1 200
The following linear programming problem described the manufacturing two products (X, & X2) by using two raw materials (R1 & R2); Max. Z= 3X, + 4X2 Subject to: (Constraint of raw material R,) 2X1 + 3X2 s 1200 2X1 + X2s 1000 (Constraint of raw material R2) X2s 200 (Demand for product X2) X1 X2 2 0 1- By using the Algebraic Analysis, find whether a change in the right-hand side for constraint of raw material R2, (1000), and the current basis remains optimal. 2- Change this linear programming model to Dual Problem Model, and find the values of the variables and W by using the optimal simplex tableau which shown below. B.V. X1 X2 S2 S3 K X1 1 - 1/4 3/4 450 X2 0 1 1/2 - 1/2 100 S3 -1/2 1/2 1 200
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:The following linear programming
problem described the manufacturing
two products (X, & X2) by using two raw
materials (R1 & R2);
Мах. Z3D 3X1 +
4X2
Subject to:
(Constraint of raw material R1)
2X1 + 3X2< 1200
2X1 + X2 s 1000
(Constraint of raw material R2)
X2s 200
(Demand for product X2)
X1 X2 z 0
1- By using the Algebraic Analysis, find
whether a change in the right-hand side
for constraint of raw material R2, (1000),
and the current basis remains optimal.
2- Change this linear programming
model to Dual Problem Model, and find
the values of the variables and W by
using the optimal simplex tableau which
shown below.
B.V. X1 X2 S1
S2
S3
K
X1
1
- 1/4 3/4
450
X2
1
1/2 - 1/2
100
S3
-1/2 1/2
1
200
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY