Optimal Prime is leading its group of AMPLbots into battle against Gigatron and the Deceivacons, fighting for the planet Psybertron. (No relation to any existing franchises, toys or movies with bad plots). Optimal Prime needs to place its troops at a number of bases, where they will be teleported to each outpost where they are needed. Each outpost has a number of required troops, and each base can only support a certain number of troops. The cost in energy of transporting a single bot from a base to an outpost is given in the map. Due to battle damage, some of the teleportation links are not working, so only the arcs shown on the map are usable. Each base also has an energy cost for each bot stationed there. Being very optimal, Optimal Prime wants to place its troops in a way that uses the least energy. Where should the troops be stationed? What would be the optimal total cost of Optimal Prime? In the diagram, bases are denoted as squares and outposts as circles. Capacity: 250 Unit cost: 20 Capacity: 300 Unit cost: 25 4 Capacity: 100 Unit cost: 10 15 20 3 Capacity: 200 Unit cost: 15 20 A Demand: 150 10 15 25 20 Demand: 100 Demand: 175 B Demand: 125 10 D Demand: 150
Optimal Prime is leading its group of AMPLbots into battle against Gigatron and the Deceivacons, fighting for the planet Psybertron. (No relation to any existing franchises, toys or movies with bad plots). Optimal Prime needs to place its troops at a number of bases, where they will be teleported to each outpost where they are needed. Each outpost has a number of required troops, and each base can only support a certain number of troops. The cost in energy of transporting a single bot from a base to an outpost is given in the map. Due to battle damage, some of the teleportation links are not working, so only the arcs shown on the map are usable. Each base also has an energy cost for each bot stationed there. Being very optimal, Optimal Prime wants to place its troops in a way that uses the least energy. Where should the troops be stationed? What would be the optimal total cost of Optimal Prime? In the diagram, bases are denoted as squares and outposts as circles. Capacity: 250 Unit cost: 20 Capacity: 300 Unit cost: 25 4 Capacity: 100 Unit cost: 10 15 20 3 Capacity: 200 Unit cost: 15 20 A Demand: 150 10 15 25 20 Demand: 100 Demand: 175 B Demand: 125 10 D Demand: 150
Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
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.
Step by step
Solved in 3 steps with 7 images
Recommended textbooks for you
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.