1 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 5500 televisions/month, whereas the output at Location II is at most 4700 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 2600 and 3700 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 11 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. Location I production -To Pulsar Factories City B City A $5 $3 $8 $11 Location II production Location II to City A shipping Location II to City B shipping Location I to City A shipping Location i to City B shipping C= I x+y≤ 5500 x+yz x < 2600 y≤ 3700 x20 y 20 ✓ subject to the constraints
1 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 5500 televisions/month, whereas the output at Location II is at most 4700 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 2600 and 3700 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 11 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. Location I production -To Pulsar Factories City B City A $5 $3 $8 $11 Location II production Location II to City A shipping Location II to City B shipping Location I to City A shipping Location i to City B shipping C= I x+y≤ 5500 x+yz x < 2600 y≤ 3700 x20 y 20 ✓ subject to the constraints
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: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 5500 televisions/month, whereas the output at
Location II is at most 4700 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 2600 and 3700 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.
Location I production
To Pulsar Factories
City A
$5
City B
$8
Location II production
Location II to City A shipping.
Location II to City B shipping
Location I to City A shipping
Location 1 to City B shipping
$3
$11
C =
I
x+y≤ 5500
x+yz
x≤2600
y≤ 3700
ΧΣΟ
y≥0
✓
subject to the constraints
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 5 steps
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,
