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 6300 televisions/month, whereas the output at Location II is at most 4600 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 4000 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. To Pulsar Factories From TMA City A City B Location I $7 $4 Location II $8 $8 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 = subject to the constraints Location I production Location II production Location II to City A shipping Location II to City B shipping Location I to City A shipping x ≥ 0 Location I to City B shipping y ≥ 0
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 6300 televisions/month, whereas the output at Location II is at most 4600 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 4000 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.
| To Pulsar Factories | ||
|---|---|---|
| From TMA | City A | City B |
| Location I | $7 | $4 |
| Location II | $8 | $8 |
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 | = |
|
subject to the constraints | |
| Location I production |
|
||||
| Location II production |
|
||||
| Location II to City A shipping |
|
||||
| Location II to City B shipping |
|
||||
| Location I to City A shipping | x ≥ 0 | ||||
| Location I to City B shipping | y ≥ 0 |
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
