Practical Management Science, Loose-leaf Version
5th Edition
ISBN: 9781305631540
Author: WINSTON, Wayne L.; Albright, S. Christian
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 5, Problem 43P
Summary Introduction
To determine: The route that uses the minimum amount of gas.
Introduction: In linear programming, the unbounded solution would occur when the objective function is infinite. If no solution satisfied the constraints, then it is said to be an unfeasible solution.
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Companies A, B, and C supply components to three plants (F, G, and H) via two crossdocking facilities (D and E). It costs $4 to ship from D regardless of final destination and $3 to ship to E regardless of supplier. Shipping to D from A, B, and C costs $3, $4, and $5, respectively, and shipping from E to F, G, and H costs $10, $9, and $8, respectively. Suppliers A, B, and C can provide 200, 300 and 500 units respectively and plants F, G, and H need 350, 450, and 200 units respectively. Crossdock facilities D and E can handle 600 and 700 units, respectively. Logistics Manager, Aretha Franklin, had previously used "Chain of Fools" as her supply chain consulting company, but now turns to you for some solid advice.
What is the objective function?
Group of answer choices
Max Z = $3AD + $3AE + $4BD + $3BE + $5CD + $3CE + $4DF + $4DG + $4DH + $10EF + $9EG + $8EH
Min Z = $3AD + $3AE + $4BD + $3BE + $5CD + $3CE + $4DF + $4DG + $4DH + $10EF + $9EG + $8EH
Min Z = $3AD + $3BE + $5CD + $3CE…
Companies A, B, and C supply components to three plants (F, G,
and H) via two crossdocking facilities (D and E). It costs $4 to ship
from D regardless of final destination and $3 to ship to E
regardless of supplier. Shipping to D from A, B, and C costs $3, $4,
and $5, respectively, and shipping from E to F, G, and H costs $10,
$9, and $8, respectively. Suppliers A, B, and C can provide 200,
300 and 500 units respectively and plants F, G, and H need 350,
450, and 200 units respectively. Crossdock facilities D and E can
handle 600 and 700 units, respectively. Logistics Manager, Aretha
Franklin, had previously used "Chain of Fools" as her supply chain
consulting company, but now turns to you for some solid advice.
Set up the solution in Excel and solve with Solver. What are total
costs?
The prices for traveling between five cities in Colorado by bus are given in the table below. Use the edge-picking algorithm to find a low-cost bus route that starts and ends in Boulder and visits each city.
Colorado Springs
Grand Junction
$48
$24
$21
$44
$57
Boulder
Denver
Boulder
$15
Colorado Springs $24
Grand Junction
$48
Durango
$73
Denver
$15
$21
$44
$71
O Boulder-Denver-Colorado Springs-Grand Junction-Durango-Boulder
O Boulder-Colorado Springs-Denver-Durango-Grand Junction-Boulder
O Boulder-Colorado Springs-Denver-Grand Junction-Durango-Boulder
O Boulder-Denver-Colorado Springs-Durango-Grand Junction-Boulder
O Boulder-Grand Junction-Colorado Springs-Denver-Durango-Boulder
$57
$58
--
$31
Durango
$73
$71
$58
$31
Chapter 5 Solutions
Practical Management Science, Loose-leaf Version
Ch. 5.2 - Prob. 1PCh. 5.2 - Prob. 2PCh. 5.2 - Prob. 3PCh. 5.2 - Prob. 4PCh. 5.2 - Prob. 5PCh. 5.2 - Prob. 6PCh. 5.2 - Prob. 7PCh. 5.2 - Prob. 8PCh. 5.2 - Prob. 9PCh. 5.3 - Prob. 10P
Ch. 5.3 - Prob. 11PCh. 5.3 - Prob. 12PCh. 5.3 - Prob. 13PCh. 5.3 - Prob. 14PCh. 5.3 - Prob. 15PCh. 5.3 - Prob. 16PCh. 5.3 - Prob. 17PCh. 5.3 - Prob. 18PCh. 5.4 - Prob. 19PCh. 5.4 - Prob. 20PCh. 5.4 - Prob. 21PCh. 5.4 - Prob. 22PCh. 5.4 - Prob. 23PCh. 5.4 - Prob. 24PCh. 5.4 - Prob. 25PCh. 5.4 - Prob. 26PCh. 5.4 - Prob. 27PCh. 5.4 - Prob. 28PCh. 5.4 - Prob. 29PCh. 5.5 - Prob. 30PCh. 5.5 - Prob. 31PCh. 5.5 - Prob. 32PCh. 5.5 - Prob. 33PCh. 5.5 - Prob. 34PCh. 5.5 - Prob. 35PCh. 5.5 - Prob. 36PCh. 5.5 - Prob. 37PCh. 5.5 - Prob. 38PCh. 5 - Prob. 42PCh. 5 - Prob. 43PCh. 5 - Prob. 44PCh. 5 - Prob. 45PCh. 5 - Prob. 46PCh. 5 - Prob. 47PCh. 5 - Prob. 48PCh. 5 - Prob. 49PCh. 5 - Prob. 50PCh. 5 - Prob. 51PCh. 5 - Prob. 52PCh. 5 - Prob. 53PCh. 5 - Prob. 54PCh. 5 - Prob. 55PCh. 5 - Prob. 56PCh. 5 - Prob. 57PCh. 5 - Prob. 58PCh. 5 - Prob. 59PCh. 5 - Prob. 60PCh. 5 - Prob. 61PCh. 5 - Prob. 62PCh. 5 - Prob. 63PCh. 5 - Prob. 64PCh. 5 - Prob. 65PCh. 5 - Prob. 66PCh. 5 - Prob. 67PCh. 5 - Prob. 68PCh. 5 - Prob. 69PCh. 5 - Prob. 70PCh. 5 - Prob. 71PCh. 5 - Prob. 72PCh. 5 - Prob. 73PCh. 5 - Prob. 74PCh. 5 - Prob. 75PCh. 5 - Prob. 76PCh. 5 - Prob. 77PCh. 5 - Prob. 80PCh. 5 - Prob. 81PCh. 5 - Prob. 82PCh. 5 - Prob. 83PCh. 5 - Prob. 85PCh. 5 - Prob. 86PCh. 5 - Prob. 87PCh. 5 - Prob. 2C
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Similar questions
- eBook Problem 10-31 A long-distance telephone company uses a fiber-optic network to transmit phone calls and other information between locations. Calls are carried through cable lines and switching nodes. A portion of the company's transmission network is shown here. The numbers above each arc show the capacity in thousands of messages that can be transmitted over that branch of the network. To keep up with the volume of information transmitted between origin and destination points, use the network to determine the maximum number of messages that may be sent from a city located at node 1 to a oty located at node 7. 3 Maximum number of messages -arrow_forwardMorgan Trucking Company operates a special pickup and delivery service between Chicago and six other cities located in a four-state area. When Morgan receives a request for service, it dispatches a truck from Chicago to the city requesting service as soon as possible. With both fast service and minimum travel costs as objectives for Morgan, it is important that the dispatched truck take the shortest route from Chicago to the specified city. Assume that the following network (not drawn to scale) with distances given in miles represents the highway network for this problem. Chicago 1 36 31 21 2 3 9 10 11 21 4 13 Find the shortest-route distance from Chicago to node 6. 6 5 6 16 6 21 7arrow_forwardMount Isa Mines is one of the world’s great metal mines. Its main operations are at Mount Isa, in Queensland, Australia, where it mines adjacent deposits of copper and silver– lead–zinc ores. Production levels change with world demand and prices, but in a typical year 7 million tonnes of ore are mined to give 150,000 tonnes of copper and lead (containing silver) and 200,000 tonnes of zinc. Mount Isa has serious transport problems. It produces huge quantities of ore in a remote area of Australia, while the main demand for finished metals is in the industrialised areas of the world, particularly Europe. The problem is to process the ores and move them to final markets as cheaply as possible. You can see the scope of the problem from an outline of the journey for copper. This starts with underground explosions to break up the ore body. The broken ore is collected by front- end loaders and put onto ore trains that carry it to underground crushers. The crushed ore is then hoisted to the…arrow_forward
- Mount Isa Mines is one of the world’s great metal mines. Its main operations are at Mount Isa, in Queensland, Australia, where it mines adjacent deposits of copper and silver-lead-zinc ores. Production levels change with world demand and prices, but in a typical year 7 million tonnes of ore are mined to give 150,000 tonnes of copper and lead (containing silver) and 200,000 tonnes of zinc. Mount Isa has serious transport problems. It produces huge quantities of ore in a remote area of Australia, while the main demand for finished metals is in the industrialized areas of the world, particularly Europe. The problem is to process the ores and move them to final markets as cheaply as possible. You can see the scope of the problem from an outline of the journey for copper, this starts with underground explosions to break up the ore body. The broken ore is collected by front-end loaders and put onto ore trains that carry it to underground crushers. The crushed ore is then hoisted to the…arrow_forwardMount Isa Mines is one of the world’s great metal mines. Its main operations are at Mount Isa, in Queensland, Australia, where it mines adjacent deposits of copper and silver-lead-zinc ores. Production levels change with world demand and prices, but in a typical year, 7 million tonnes of ore are mined to give 150,000 tonnes of copper and lead (containing silver) and 200,000 tonnes of zinc. Mount Isa has serious transport problems. It produces huge quantities of ore in a remote area of Australia, while the main demand for finished metals is in the industrialized areas of the world, particularly Europe. The problem is to process the ores and move them to final markets as cheaply as possible. You can see the scope of the problem from an outline of the journey for copper, this starts with underground explosions to break up the ore body. The broken ore is collected by front-end loaders and put onto ore trains that carry it to underground crushers. The crushed ore is then hoisted to the…arrow_forwardPlease help me with part barrow_forward
- Is transportation modeling a type of linear programming? Justify your answerarrow_forwardA fertilizer manufacturer has to fulfill supply contracts to its two main customers (650 tons to Customer A and 800 tons to Customer B). It can meet this demand by shipping existing inventory from any of its three warehouses. Warehouse 1 has 400 tons of inventory onhand, Warehouse 2 (W2) has 500 tons, and Warehouse 3 (W3) has 600 tons. The company would like to arrange the shipping for the lowest cost possible, where the per-ton transit costs are as follows: W 1 W 2 W 3 $7.50 $6.75 $6.25 $7.00 $6.50 $8.00 Customer A Customer B Write the objective function and the constraint in equations. Let V;= tons shipped to customer i from warehouse j, and so on. For example, VA1 = tons shipped to customer A from warehouse W1. This exercise contains only parts b, c, d, e, and f. b) The objective function for the LP model = Minimize Z = $7.50 + $6.25 + $6.50 (shipping cost to customer A) V + $6.75 + $7.00 + $8.00 (shipping cost to customer B) c) Subject to: Customer A's demand Customer B's demand…arrow_forwardI need solve this fast pleasearrow_forward
- NTS is a Swiss intermodal operator located in Lausanne. When customers need to transport goods between origin and destination, NTS supplies them with one or more empty containers in which the goods can be loaded.Upon arrival at the destination, the goods are unloaded, and the empty containers must be transported to the pickup point for new customers. Therefore, NTS management needs to reallocate empty containers periodically (every week). The company's focus is on the transportation activity of empty containers, which is very expensive (almost 35% of the total operational costs). In May 2023, several empty containers, totaling 20 containers, need to be reallocated among terminals in Amsterdam, Berlin, Munich, Paris, Milan, Barcelona, and Madrid. The available or requested number of empty containers at various terminals is reported, along with the transportation costs (in euros per container) as seen in Figure 1. Determine how to solve the problem with the goal of minimizing…arrow_forwardNTS is a Swiss intermodal operator located in Lausanne. When customers need to transport goods between origin and destination, NTS supplies them with one or more empty containers in which the goods can be loaded. Upon arrival at the destination, the goods are unloaded, and the empty containers must be transported to the pickup point for new customers. Therefore, NTS management needs to reallocate empty containers periodically (every week). The company's focus is on the transportation activity of empty containers, which is very expensive (almost 35% of the total operational costs). In May 2023, several empty containers, totaling 20 containers, need to be reallocated among terminals in Amsterdam, Berlin, Munich, Paris, Milan, Barcelona, and Madrid. The available or requested number of empty containers at various terminals is reported, along with the transportation costs (in euros per container) as seen in Figure 1.Determine how to solve the problem with the goal of minimizing…arrow_forwardDefine Vehicle routing problem (VRP). Explain its complications and variants. Define four different real-life problems that can be formulated as VRP. Explain their properties based on VRP variations.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,