Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
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

Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter2: Systems Of Linear Equations
Section2.4: Applications
Problem 16EQ
See similar textbooks
icon
Related questions
Question
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 Minimize 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. c = 7x + 4y + 8 (3000-x)+11 (3800 - y) C= subject to the constraints Location I production Location II production Location II to City A shipping To Pulsar Factories City A $7 City B $4 $8 $11 Location II to City B shipping Location I to City A shipping Location I to City B shipping x < 6500 X 3000x4900 3000-x>0 3800 y 20 x 20 ΥΣΟ X
Transcribed Image Text: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 Minimize 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. c = 7x + 4y + 8 (3000-x)+11 (3800 - y) C= subject to the constraints Location I production Location II production Location II to City A shipping To Pulsar Factories City A $7 City B $4 $8 $11 Location II to City B shipping Location I to City A shipping Location I to City B shipping x < 6500 X 3000x4900 3000-x>0 3800 y 20 x 20 ΥΣΟ X
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 30 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
SEE MORE TEXTBOOKS