A 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 3 B 1 3 4

A 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 3 B 1 3 4

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

Zara is a global clothing company based in Spain and it gives utmost importance to customer value, hence it tries to catch customer satisfaction in transportation. Zara expects the following points to be fulfilled by transport companies: The products must be reached to desired places on time, the products must be shipped without any damage or unwanted condition, the products must be carried to next channel level in a good condition. Additionally, Zara gives less weight to freight costs while determining product prices. Which of the followings is less important in transportation policy of Zara? Select one: a. Condition of goods b. Pricing c. Delivery performance d. Customer satisfaction
A company is producing a single product and selling it through five agencies situated in different cities. All of a sudden, there is a demand for the product in five more cities that do not have any agency of the company The company is faced with the problem of deciding on how to assign the existing agencies to dispatch the product to the additional cities in such a way that the travelling distance is minimised. The distances (in km) between the surplus and deficit cities are given in the following distance matrix.
Cars-to-Dealers Logistics Inc. is the exclusive logistics provider for the Summit Motor Co. and has responsibilityfor transporting cars from Summit’s 3 manufacturing plants in Toledo, OH; Charlotte, NC and Savannah, GA tothe 7 regional dealer locations as in the tables provided in your dataset. To do this, Cars-to-Dealers uses threetransshipment facilities and all cars in the distribution network pass through these transshipment facilities.Dataset also contains the information about the capacities of each of these transshipment facilities, the demandrequirement at each of the regional dealer locations and the unit cost to ship one car between the variouslocations.In addition to supply of cars (manufacturers) and demand for cars (dealers) there are two types of constraintsfor each transshipment facility:1. Balance flow constraints: dictate that all cars flowing into a transshipment facility should also flow out of thetransshipment facility – i.e. no inventory of cars should remain at…
Cleveland Area Rapid Delivery (CARD) operates a delivery service in the Cleveland metropolitan area. Most of CARD's business involves rapid delivery of documents and parcels between offices during the business day. CARD promotes its ability to make fast and on-time deliveries anywhere in the metropolitan area. When a customer calls with a delivery request, CARD quotes a guaranteed delivery time. The following network shows the street routes available. The numbers above each arc indicate the travel time in minutes between the two locations. Min s.t. Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows 35 For all X;; = 0, 1. (a) Develop a linear programming model that can be used to find the minimum time required to make a delivery from location 1 to location 6. (Express your answers in the form where each Xij represents the arc from node i to node j as either 1 or Xijr 0.) 30 12 p.m. 3 Need Help? Read It 18 15 39 12 16 5 (b) How long (in minutes) does it take to…
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.
A dynamic distance vector protocol used in the Internet as exterior routing protocol: O OFPF О ВБР O ICMP RIP
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 -
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.
A supplier ships goods from Richmond, VA to three market places in 3 cities (Chicago, IL; Athens, GA; St. Luis, MO). The supplier can ship every day, every other day, or every third day. There is a penalty of $0.30/cwt for each day delayed. Consolidating shipments allows for lower transportation costs from larger loads, but incurs penalty costs due to the delay. Transportation Rate (S/cwt) Shipment City Weight/day LTL 50,000 lb 50000 lb Chicago, IL 18,000 lb (180 cwt) 1.50 1.25 Athens, GA 15,000 lb (150 cwt) 1.35 1.00 St. Luis, MO 12,000 lb (120 cwt) 2.00 1.50 Total 45,000 Ib = 450 cwt Find what is the cost for the following: Shipping Every Day Shipping on the alternate Day (every two days) Shipping every three Day
A supplier ships goods from Richmond, VA to three market places in 3 cities (Chicago, IL; Athens, GA; St. Luis, MO). The supplier can ship every day, every other day, or every third day. There is a penalty of $0.30/cwt for each day delayed. Consolidating shipments allows for lower transportation costs from larger loads, but incurs penalty costs due to the delay. Transportation Rate (S/cwt) Shipment City Weight/day LTL 50,000 lb 50000 Ib Chicago, IL 18,000 lb (180 cwt) 1.50 1.25 Athens, GA 15,000 lb (150 cwt) 1.35 1.00 St. Luis, MO 12,000 lb (120 cwt) 2.00 1.50 Total 45,000 lb = 450 cwt !3! Find what is the cost for the following: Shipping Every Day Shipping on the alternate Day (every two days) Shipping every three Day
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
Morgan 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 7