A company purchasing scrap material has two types of scarp materials available. The first type has 30% of material X, 20% of material Y and 50% of material Z by weight. The second type has 40% of material X, 10% of material Y and 30% of material Z. The costs of the two scraps are Rs.120 and Rs.160 per kg respectively. The company requires at least 240 kg of material X, at most 100 kg of material Y and exactly 290 kg of material Z. The company wants to determine the optimum quantities of the two scraps to be purchased so that their requirements of the three materials are satisfied at a minimum cost. Formulate the problem as a linear programming problem. b) Solve the following LP problem using graphical method. Max z = 3x1 + 4x2 Subject to 2x1 + x2 < 10 X1 + 3x2 S 12 X1,X2 2 0
A company purchasing scrap material has two types of scarp materials available. The first type has 30% of material X, 20% of material Y and 50% of material Z by weight. The second type has 40% of material X, 10% of material Y and 30% of material Z. The costs of the two scraps are Rs.120 and Rs.160 per kg respectively. The company requires at least 240 kg of material X, at most 100 kg of material Y and exactly 290 kg of material Z. The company wants to determine the optimum quantities of the two scraps to be purchased so that their requirements of the three materials are satisfied at a minimum cost. Formulate the problem as a linear programming problem. b) Solve the following LP problem using graphical method. Max z = 3x1 + 4x2 Subject to 2x1 + x2 < 10 X1 + 3x2 S 12 X1,X2 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
Question
Transcribed Image Text:A company purchasing scrap material has two types of scarp materials available. The first
type has 30% of material X, 20% of material Y and 50% of material Z by weight. The
second type has 40% of material X, 10% of material Y and 30% of material Z. The costs
of the two scraps are Rs.120 and Rs.160 per kg respectively. The company requires at
least 240 kg of material X, at most 100 kg of material Y and exactly 290 kg of material Z.
The company wants to determine the optimum quantities of the two scraps to be
purchased so that their requirements of the three materials are satisfied at a minimum
cost. Formulate the problem as a linear programming problem.
b) Solve the following LP problem using graphical method.
Max z = 3x1 + 4x2
Subject to
2x1 + x2 < 10
X1 + 3x2 S 12
X1,X2 2 0
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 1 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,
