Practical Management Science
5th Edition
ISBN: 9781305250901
Author: Wayne L. Winston, S. Christian Albright
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 6.5, Problem 25P
Summary Introduction
To determine: The change in the model and find the optimal solution using solver.
Introduction: The variation between the present value of the
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
At the end of a cycle of schedules, a trucking firm has a surplus of one vehicle each in cities A, B, C, D, E, and F and a deficit of one vehicle each in cities 1, 2, 3, 4, 5, and 6. The distances between cities with a surplus and the cities with a deficit are shown below. Find an assignment of surplus vehicles to deficit cities that will result in a minimum total distance. What is the total distance?
-Solve the following transportation models using Excel Solver.
-Find the optimal solution for the transportation problem having the cost and requirement tablebelow.
Solve the problem,
8) Chelsea Avanos is searching for a job. She lives in Winston-Salem, North Carolina, and has
interviews in Tacoma, Washington; Pittsburgh, Pennsylvania; and Gainesville, Florida. The
costs for one-way flights between these cities are summarized below:
|Gainesville Pittsburgh Tacoma Winston-Salem
$746 $408
$725 $391
$1028
Gainesville
$353
Pittsburgh
$353
$746
Winston-Salem/s408
$725
$391
Tacoma
$1028
Represent this traveling salesman problem with a complete graph showing the distances
on the appropriate edges.
The plant engineer for the Bitco manufacturing plant is designing an overhead conveyor system that will connect the distribution/inventory center to all areas of the plant. The network of possible conveyor routes through the plant, with the length (in feet) along each branch, follows: Determine the shortest conveyor route from the distribution/inventory center at node 1 to each of the other six areas of the plant.
Chapter 6 Solutions
Practical Management Science
Ch. 6.3 - Prob. 1PCh. 6.3 - Prob. 2PCh. 6.3 - Solve Problem 1 with the extra assumption that the...Ch. 6.3 - Prob. 4PCh. 6.3 - Prob. 5PCh. 6.3 - Prob. 6PCh. 6.3 - Prob. 7PCh. 6.3 - Prob. 8PCh. 6.3 - Prob. 9PCh. 6.3 - Prob. 10P
Ch. 6.4 - Prob. 11PCh. 6.4 - Prob. 12PCh. 6.4 - Prob. 13PCh. 6.4 - Prob. 14PCh. 6.4 - Prob. 15PCh. 6.4 - Prob. 16PCh. 6.4 - Prob. 17PCh. 6.4 - Prob. 18PCh. 6.4 - Prob. 19PCh. 6.4 - Prob. 20PCh. 6.4 - Prob. 21PCh. 6.4 - Prob. 22PCh. 6.4 - Prob. 23PCh. 6.5 - Prob. 24PCh. 6.5 - Prob. 25PCh. 6.5 - Prob. 26PCh. 6.5 - Prob. 28PCh. 6.5 - Prob. 29PCh. 6.5 - Prob. 30PCh. 6.5 - In the optimal solution to the Green Grass...Ch. 6.5 - Prob. 32PCh. 6.5 - Prob. 33PCh. 6.5 - Prob. 34PCh. 6.5 - Prob. 35PCh. 6.6 - Prob. 36PCh. 6.6 - Prob. 37PCh. 6.6 - Prob. 38PCh. 6 - Prob. 39PCh. 6 - Prob. 40PCh. 6 - Prob. 41PCh. 6 - Prob. 42PCh. 6 - Prob. 43PCh. 6 - Prob. 44PCh. 6 - Prob. 45PCh. 6 - Prob. 46PCh. 6 - Prob. 47PCh. 6 - Prob. 48PCh. 6 - Prob. 49PCh. 6 - Prob. 50PCh. 6 - Prob. 51PCh. 6 - Prob. 52PCh. 6 - Prob. 53PCh. 6 - Prob. 54PCh. 6 - Prob. 55PCh. 6 - Prob. 56PCh. 6 - Prob. 57PCh. 6 - Prob. 58PCh. 6 - Prob. 59PCh. 6 - Prob. 60PCh. 6 - Prob. 61PCh. 6 - Prob. 62PCh. 6 - Prob. 63PCh. 6 - Prob. 64PCh. 6 - Prob. 65PCh. 6 - Prob. 66PCh. 6 - Prob. 67PCh. 6 - Prob. 68PCh. 6 - Prob. 69PCh. 6 - Prob. 70PCh. 6 - Prob. 71PCh. 6 - Prob. 72PCh. 6 - Prob. 73PCh. 6 - Prob. 74PCh. 6 - Prob. 75PCh. 6 - Prob. 76PCh. 6 - Prob. 77PCh. 6 - Prob. 78PCh. 6 - Prob. 79PCh. 6 - Prob. 80PCh. 6 - Prob. 81PCh. 6 - Prob. 82PCh. 6 - Prob. 83PCh. 6 - Prob. 84PCh. 6 - Prob. 85PCh. 6 - Prob. 86PCh. 6 - Prob. 87PCh. 6 - Prob. 88PCh. 6 - Prob. 89PCh. 6 - Prob. 90PCh. 6 - Prob. 91PCh. 6 - Prob. 92PCh. 6 - This problem is based on Motorolas online method...Ch. 6 - Prob. 94PCh. 6 - Prob. 95PCh. 6 - Prob. 96PCh. 6 - Prob. 97PCh. 6 - Prob. 98PCh. 6 - Prob. 99PCh. 6 - Prob. 100PCh. 6 - Prob. 1CCh. 6 - Prob. 2CCh. 6 - Prob. 3.1CCh. 6 - Prob. 3.2CCh. 6 - Prob. 3.3CCh. 6 - Prob. 3.4CCh. 6 - Prob. 3.5CCh. 6 - Prob. 3.6C
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
- 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?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_forwardCompanies 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…arrow_forward
- I need solve this fast pleasearrow_forwardAbu Dhabi municipality is given an assignment to ensure provision of enough water for residents of the Abu Dhabi city. The water is purified in a large water treatment plant (node 1) and then is sent via a water supply network to the Abu Dhabi city (node 14). As shown in the below water supply network, the capacity of each water pipeline (arc) is shown in million liters per hour. For example, the hourly water flow from node 1 to node 2 is four million liters, and from node 2 to node 1 is zero million liters. a) The municipality is interested to find out how much water (in million liters per hour) can be sent from the water treatment plant to the Abu Dhabi city via this water supply network. Determine it. b) Due to a maintenance problem both nodes 10 and 11 need to be taken offline. Therefore, these nodes cannot flow any water in and out. How this problem impacts the network maximum flow capacity? Please include algebraic method and excel solver.arrow_forwardSuppose in the given problem that additional constraints arise from the fact that certain tasks cannot be performed at the same station. In particular suppose that the tasks are zoned in the following manner:Zone 1 Tasks 2, 3, 1, 4, 6Zone 2 Tasks 5, 8, 7, 9Zone 3 Tasks 10, 11Assuming that only tasks in the same zone category can be performed at the same station, determine the resulting line balance for the problem based on a 45‑second cycle time.arrow_forward
- The MidLands Trucking Company based in Louisvillehas eight trucks located throughout the Mideast that havedelivered their loads and are available for shipments. Through their Internet logistics site MidLands has re-ceived shipping requests from 12 customers. The follow-ing table shows the mileage for a truck to travel to a customer location, pick up the load, and deliver it. Determine the optimal assignment of trucks to customersthat will minimize the total mileage. Customers Truck A B C D E F G H I J K L1 500 730 620 410 550 600 390 480 670 710 440 5902 900 570 820 770 910 660 650 780 840 950 590 6703 630 660 750 540 680 750 810 560 710 1200 490 6504 870 1200 810 670 710 820 1200 630 700 900 540 6205 950 910 740 810 630 590 930 650 840 930 460 5606 1100 860 800 590 570 550 780 610 1300 840 550 7907 610 710 910 550 810 730 910 720 850 760 580 6308 560 690 660 640 720 670 830 690 880 1000 710 680arrow_forwardA truck must travel from New York to Los Angeles. As shown in the network below, several routes are available. From To Gas Gallons New York Cleveland 400 New York St. Louis 950 New York Nashville 800 Cleveland Phoenix 1800 900 1100 600 Cleveland Dallas St. Louis St. Louis Phoenix Dallas Nashville Dallas 600 Salt Lake City Los Angeles Phoenix Salt Lake City Los Angeles Los Angeles Nashville 1200 Phoenix 400 Dallas 900 Dallas Dallas 1000 1300 Salt Lake City 600 A) Draw the network diagram showing all nodes, arcs, and costs associated with this model.arrow_forwardA manufacturer produces sport wheels at three plants located in towns A, B and C. The wheels are sent to three warehouses located at X, Y and Z. The plant in Town A has 400 units available each month, Town B has 600 units and Town C has 800 units. The requirements of warehouses at X, Y and Z are 200, 500 and 1,100 respectively. The transportation costs (in RM) for various routes are given in the table below. The company would like to determine the least-cost way to meet the demand at each of the warehouses. Factory Warehouse X Y A 2 2 В 1 6. 1 3 4 Formulate an initial feasible solution using the northwest corner rule. а. b. Use the stepping stone method to find the optimal solution that will minimize transportation cost of this problem.arrow_forward
- 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 $31arrow_forwardWith the Linear Programming given below, solve Phase I of the Two-Phase Method, then make the starting tableau for Phase II Max Z = 2x1 + 3x2 subject to x1 + x2 = 7 2x1 - 5x2 >= 10 x1, x2 >= 0arrow_forwardIn the original Gorman Construction Company problem, we found the shortest distance from the office (node 1) to the construction site located at node 6. Because some of the roads are highways and others are city streets, the shortest-distance routes between the office and the construction site may not necessarily provide the quickest or shortest-time route. Shown here is the Gorman road network with travel time rather than distance. Find the shortest route from Gorman’s office to the construction site at node 6 if the objective is to minimize travel time rather than distance.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,