Mad Max wants to travel from New York to Dallas bythe shortest possible route. He may travel over the routesshown in Table 8. Unfortunately, the Wicked Witch canblock one road leading out of Atlanta and one road leadingout of Nashville. Mad Max will not know which roads havebeen blocked until he arrives at Atlanta or Nashville. ShouldMad Max start toward Atlanta or Nashville? Which routesshould the Wicked Witch block? Route (Miles)New York–Atlanta 800New York–Nashville 900Nashville–St. Louis 400Nashville–New Orleans 200Atlanta–St. Louis 300Atlanta–New Orleans 600St. Louis–Dallas 500New Orleans–Dallas 300

Mad Max wants to travel from New York to Dallas bythe shortest possible route. He may travel over the routesshown in Table 8. Unfortunately, the Wicked Witch canblock one road leading out of Atlanta and one road leadingout of Nashville. Mad Max will not know which roads havebeen blocked until he arrives at Atlanta or Nashville. ShouldMad Max start toward Atlanta or Nashville? Which routesshould the Wicked Witch block? Route (Miles)New York–Atlanta 800New York–Nashville 900Nashville–St. Louis 400Nashville–New Orleans 200Atlanta–St. Louis 300Atlanta–New Orleans 600St. Louis–Dallas 500New Orleans–Dallas 300

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section: Chapter Questions

Problem 100P

See similar textbooks

Similar questions

2. Frieda Millstone and her family live in Roanoke, Virginia, and they are planning an auto vacation across Virginia, their ultimate destination being Washington, DC. The family has developed the following network of possible routes and cities to visit on their trip: The time, in hours, between cities (which is affected by the type of road and the number of intermediate towns) is shown along each branch. Determine the shortest Weebingten Stayate Charletteaui route that the Millstone family can travel from Roanoke to Washington, DC.
TRANSPORTATION METHOD: INSTRUCTIONS: Solve for the optimal distribution and cost of transportation using the given problem below. Show all solutions. GJR Company received a contract to supply unleaded gasoline tofour different locations. Project A needs 60,000 liters, Project B needs 90,000 liters, Project C needs 20,000 liters, and Product D needs 30,000 liters. The company has two depot located in two different places. Depot 1 has 120,000 liters available and Depot 2 has 80,000 liters available. Cost to Transport Project A Project B Project C Project D Depot 1 5 7 3 4 Depot 2 8 8 SIMPLEX METHOD: Instructions: Determine the optimal solution. Maximize: 50X1 + 20 X2 Subject to: X1 s20 Activate Windows X2 30 Go to Settings to activate X1 + X2 248
4. The origins at 2 plants at Cagayan de Oro and Davao with capacities of 500 and 700 units, while the destinations are 3 distribution centers with demands of 400, 500 and 300 respectively. The costs of transporting a unit of the product from origins to destinations are shown below: ORIGIN DISTRIBUTION CENTERS DC1 DC2 DC3 Cagayan de Oro 6 4 Davao 6. 3 REQUIRED: Draw the network model and create the linear programming of this transportation problem.
S7.12. The Federal Parcel Service wants to build a new distribution cen- ter in Charlotte, North Carolina. The center needs to be in the vicinity of uncongested Interstate-77 and Interstate-85 interchanges and the Char- lotte-Douglas International Airport. The coordinates of these three sites and the number of weekly packages that flow to each are as follows: 1-77 1-85 Airport X= 14 X= 20 X= 30 y = 30 y = 8 ソ=14 w = 17,000 w = 12,000 W = 9000 Determine the best site location using the center-of-gravity technique.
The following table shows delivery costs of assigning different trucks to different routes. Determine the optimal truck-route assignment that minimizes the total cost of delivery. What is the total cost of the optimal assignment?
Travelling Salesman Problem (TSP); Given the following distance matrix, use the nearest neighbor (NN) heuristic to find a route that starts from the warehouse (W), visits each customer only once, and finishes at the warehouse to minimize the distance traveled. What is the route and the corresponding distance? Distances W 1 2 3 4 in miles 18 57 27 50 18 0 65 29 61 57 65 0 36 99 3 27 29 36 0 76 4 50 61 99 76 Route=W-1-3-2-4, Distance=182 miles Route=W-3-1-2-4-W, Distance=270 miles Route = W-3-1-2-4, Distance=220 miles Route=W-1-3-2-4-W, Distance=232 miles Route=W-1-3-4-2, Distance=272 miles 1, 2.
nabled: Chapter 6 Network Optimizati. i Help Saved Save & A minimum-cost flow problem has 6 supply nodes, 0 transshipment nodes, and 5 demand nodes. If each supply node can ship to every demand node, how many arcs will be included in the model? Number of arcs
TRANSPORTATION METHOD: INSTRUCTIONS: Solve for the optimal distribution and cost of transportation using the given problem below. Show all solution. GIR Company received a contract to supply unleaded gasolne to four different locations Project A needs 60,000 iters, Project Bneeds 90,000 liters, Project Oneeds 20,000 liters, and Product D needs 30,000 liters. The company has two depot located in two different places, Depot 1 har 220.000 liters available and Depot 2 has 80,000 sters wal sole. Cost to Transport Project Project B Project C Proxecto 5 7 13 Depot 1 Depot 2 8 6 B B SIMPLEX METHOD: Instruction Detamine the optimal solution Mimiz 50XL -20 X2 Subject to X1 420 X1 X2 248
Transportation Problem (Solve using excel): Acme Block Company has orders for 80 tons of concrete blocks at three suburban locations as follows: Northwood -- 25 tons, Westwood -- 45 tons, and Eastwood -- 10 tons. Acme has two plants, each of which can produce 50 tons per week. Delivery cost per ton from each plant to each suburban location is shown in the attached image. How should end of week shipments be made to fill the above orders?
Assignment Find the initial solution of the given transportation problem using the 3 methods. Suppose a manufacturing company owns three factories (sources) and distribute his products to five different retail agencies (destinations). The following table shows the capacities of the three factories, the quantity of products required by the various retail agencies and the cost of shipping one unit of the product from each of the three factories to each of the five retail agencies. Factories 1 1 2 1 9 24 12 14 33 Requirement 100 60 2 3 Retail Agency 3 13 16 1 50 4 5 35 50 20 1 23 26 50 40 Capacity 50 100 150 300 ✓
Required information The Childfair Company has three plants producing child push chairs that are to be shipped to four distribution centers. Plants 1, 2, and 3 produce 12, 17, and 11 shipments per month, respec- tively. Each distribution center heeds to receive 10 shipments per month. The distance from each plant to the respective distributing centers is given below: Distance Plant 1 2 3 1 1450 1750 1250 Distribution Center 3 1050 1250 1450 Obtain an optimal solution, and determine the total cost. Total Cost = $ 2 1950 2050 1850 The freight cost for each shipment is $100 plus 50 cents per mile. 4 1350 1650 1550
3. The Burger Doodle restaurant franchises in Los Angeles are supplied from a central warehouse in Inglewood. The location of the warehouse and its proximity, in minutes of travel time, to the franchises are shown in the following network: San Fernando Valley Burbank Pomona 28 25 36 35 18 Pasadena 29 45 41 50 Westwood 2 25 Downey 40 32 7 Anahoim Inglewood 20 27 48 17 5 Long Beach 24 10 Huntington Boach Determine the shortest route from the warehouse at Inglewood to each of the nine franchises.