Formulate but do not solve the following exercise as a linear programming problem. TMA manufactures 37-in. high-definition LCD televisions in two separate locations: Location I and Location II. The output at Location I is at most 6500 televisions/month, whereas the output at Location II is at most 4900 televisions/month. TMA is the main supplier of televisions to Pulsar Corporation, its holding company, which has priority in having all its requirements met. In a certain month, Pulsar placed orders for 3000 and 3800 televisions to be shipped to two of its factories located in City A and City B, respectively. The shipping costs (in dollars) per television from the two TMA plants to the two Pulsar factories are as follows. From TMA Location I Location II Location I production Location II production To Pulsar Factories City A $7 City B TMA will ship x televisions from Location I to City A and y televisions from Location I to City B. Find a shipping schedule that meets the requirements of both companies while keeping costs, C (in dollars), to a minimum. Minimize c=7x+4y+8(3000-x)+11 (3800-y) subject to the constraints Location II to City A shipping Location II to City 8 shipping Location I to City A shipping Location I to City 8 shipping $8 $4 $11 x≤6500 x 3000-x≤ 4900 3000-x>0 3800-20 y 20 x
Formulate but do not solve the following exercise as a linear programming problem. TMA manufactures 37-in. high-definition LCD televisions in two separate locations: Location I and Location II. The output at Location I is at most 6500 televisions/month, whereas the output at Location II is at most 4900 televisions/month. TMA is the main supplier of televisions to Pulsar Corporation, its holding company, which has priority in having all its requirements met. In a certain month, Pulsar placed orders for 3000 and 3800 televisions to be shipped to two of its factories located in City A and City B, respectively. The shipping costs (in dollars) per television from the two TMA plants to the two Pulsar factories are as follows. From TMA Location I Location II Location I production Location II production To Pulsar Factories City A $7 City B TMA will ship x televisions from Location I to City A and y televisions from Location I to City B. Find a shipping schedule that meets the requirements of both companies while keeping costs, C (in dollars), to a minimum. Minimize c=7x+4y+8(3000-x)+11 (3800-y) subject to the constraints Location II to City A shipping Location II to City 8 shipping Location I to City A shipping Location I to City 8 shipping $8 $4 $11 x≤6500 x 3000-x≤ 4900 3000-x>0 3800-20 y 20 x
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
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 5 steps with 30 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,