20. Suppose that one wishes to schedule vehicles from a central depot to five customerlocations. The cost of making trips between each pair of locations is given in thefollowing matrix. (Assume that the depot is location 0.)Cost Matrix (c)то12345753310301542F13520R2185834020M425Assume that these costs correspond to distances between locations and thateach vehicle is constrained to travel no more than 50 miles on each route. Find therouting suggested by the savings method.20

0 1 2 3 4 5 0 20 75 33 10 30 F 1 35 5 20 15 R 2 18 58 42 O 3 40 20…

Answered: 20. Suppose that one wishes to schedule…

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...

See similar textbooks

Similar questions

Q: When we solve the given transportation problem according to the lowest cost method, which warehouse and/or warehouses are suitable for shipment from f3 (F: Factory M: Customer)A) no needb) M1, M2, M3c) M1 and M2d) M3 and M1E) M3
Suppliers A, B, and C supply components to three plants -- F, G, and H via two transshipment facilities -- T1 and T2. It costs $4 to ship from T1 regardless of final destination and $3 to ship to T2 regardless of supplier. Shipping to T1 from A, B, and C costs $3, $4, and $5, respectively, and shipping from T2 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. The Logistics Manager has come to you for help. Answer the following question: Which of these is not an element of the objective function? Group of answer choices 4D-T1 600T1 9T2-G 3C-T2 Plz do fast asap
A company has four distribution centers, located in Atlanta, Lexington, Milwaukee, and Salt Lake City, and ships to 12 retail stores, located in Seattle, San Francisco, Las Vegas, Tucson, Denver, Charlotte, Minneapolis, Fayetteville, Birmingham, Orlando, Cleveland, and Philadelphia. The company wants to minimize the transportation costs of shipping one of its products. The per-unit shipping cost from each distribution center to each retail location and the amounts currently in inventory and ordered at each retail location are shown in the accompanying table. Develop and solve an optimization model to minimize the total transportation cost and answer parts a and b. Click here to view the shipping data. .... a. What is the minimum cost of shipping? Total Cost = S (Type an integer or a decimal. Do not round.)
Q3) The Cure medical distribution center distributes urgent medical equipment for five local hospitals in Washington DC metropolitan area. Cure Medical distribution would like to invest in a new warehouse in Washington DC to minimize the total distance from five major hospitals. The coordinate of the five hospitals is given below: ( (2) 3 Great Fall (C) (47) 122 (121) Fairfax 10 We W Bu (645) -D (-20, 30)- -E (-40, -30) Colesville Fairland Calpen A (10,60) -B (10,-10) Ⓡ South Lourel stuxent search Refuge (MA A (14) tille (214) pha Bowit (00 X -C (45, -20) 201 C a) Use Solver to determine where the new warehouse should be in to minimize the total distance from 5 hospitals. What are the coordinates of the new warehouse? b) Solve your problem again to minimize the maximum distance between hospitals and the new warehouse. What are the coordinates of the new warehouse?
Consider the following network representation of a transportation problem. Let Min 40 s.t. 35 Supplies From Jefferson City From Omaha To Des Moines Jefferson City To Kansas City Omaha To St. Louis 14 9 8 X11 = amount shipped from Jefferson City to Des Moines X12 = amount shipped from Jefferson City to Kansas City X13 = amount shipped from Jefferson City to St. Louis X21 amount shipped from Omaha to Des Moines X22 = amount shipped from Omaha to Kansas City X23 = amount shipped from Omaha to St. Louis 8 11 24 The supplies, demands, and transportation costs per unit are shown on the network. (a) Develop a linear programming model for this problem; be sure to define the variables in your model. Des Moines Kansas City St. Louis 25 10 40 Demands
4. 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?
Formulate a linear program using LP Model Formulation. Miguel hauls mangoes between Manila mango plantation and packing plants in Clark. Miguel’s schedule this week calls for 500 boxes with locations and costs as follows.
A truck driver has to deliver a load of lumber to oneof two construction sites, which are, respectively, 27 and 33 miles from the lumberyard, but he has misplaced theorder telling him where the load of lumber should go. The two construction sites are 12 miles apart, and, to compli-cate matters, the telephone at the lumberyard is out of order. Where should he go first if he wants to minimizethe distance he can expect to drive and he feels that(a) the odds are 5 to 1 that the lumber should go to theconstruction site that is 33 miles from the lumberyard;(b) the odds are 2 to 1 that the lumber should go to theconstruction site that is 33 miles from the lumberyard;(c) the odds are 3 to 1 that the lumber should go to theconstruction site that is 33 miles
Q2. Pharmaceutical company producing asingle product sold it through five agencies situated in different cities. All of sudden there rouse a demand for the product in another five cities that didn't agency of the company. The company is now facing the problem of deciding on how to assign the existing agencies in order to dispatch the product to needy cities in such a waythat the travelling distance is minimized. The distance between the surplus and deficit cities in kilometer is given the following table. Surplus city Deficit cities Deficit cites A1 160 130 115 190 200 B1 135 120 130 160 175 C1 140 110 125 170 185 D1 50 50 80 80 110 E1 55 35 80 80 105 Determine the optimum assignment schedule.
2. Metropolitan Manila has four incinerator sites for processing solid waste. There are five garbage collection areas within the metropolis. The city wants to determine the least-cost method of disposing of its trash. Each incinerator is characterized by an operating cost for processing each ton of waste and also a cost for transporting each ton of waste is summarized in the table below: Collection Incinerator Site Area 1 2 3 4 50 120 110 60 B 100 55 90 70 60 40 80 65 90 75 85 110 80 100 95 65 Incinerator sites 1 and 2 have a weekly capacity of 6,000 tons each, site 3 has a capacity of 8,000 tons and site 4 has a capacity of 10,000 tons. There are 4,000 tons of waste generated at area A, 8,000 tons at area B and 5,000 tons each at areas C and D, each week. A total of 25,000 tons of waste each week are generated from all five areas.
Qn1. Find the optimal solution to the transportation problem using MODI method. Warehouses Supply WI W2 W3 W4 P1 19 30 50 12 Plants 5. 2. P2 70 30 40 60 P3 40 10 60 20 3. 15 Demand 4)
9-43. Northwest University is in the process of complet-ing a computer bus network that will connect com-puter facilities throughout the university. The prime objective is to string a main cable from one endof the campus to the other (nodes 1–25) throughunderground conduits. These conduits are shownin the network below; the distance between them isin hundreds of feet. Fortunately, these undergroundconduits have remaining capacity through which thebus cable can be placed.(a) Given the network for this problem, how long (inhundreds of feet) is the shortest route from node1 to node 25?(b) In addition to the computer bus network, a newphone system is also being planned. The phonesystem would use the same underground conduits. If the phone system were installed, the follow-ing paths along the conduit would be at capacity and would not be available for the computer busnetwork: 6–11, 7–12, and 17–20. What changes(if any) would you have to make to the pathused for the computer bus if the phone…

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

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

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

Business in Action

Operations Management

ISBN:

9780135198100

Author:

BOVEE

Publisher:

PEARSON CO

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.

SEE MORE TEXTBOOKS