Please help with this problem. Thanks. Shipping Costs ($):3U.S. Warehouses4U.S. WarehousesNorfolkNew YorkSavannahSupplyShippedPortNorfolkNew YorkSavannah5Port390610HamburgMarseillesLiverpool55420Hamburg785105904707Marseilles37450360480LiverpoolShipped81011Shipping Costs ($):Distribution Centers12Distribution CentersU.S. WarehousesDallasSt. LouisChicagoShippedWarehousesDallasSt. LouisChicago13Norfolk75638114Norfolk11095New YorkSavannah125New YorkSavannah156882951617Demand60455018Shipped1920 Transshipment flows:21Norfolk22New York23Savannah2425Cost262728 The purpose of this assignment is to extend the Transportation Model to a more realisticapplication of linear programming, the Transshipment Model. In this model, intermediate trans-shipment points are added between the sources and destinations. These intermediate points donot hold inventory. Items may be transported from sources through transhipment points ontodestinations.You will use Solver to find the solution.TaskComplete the problem described in the template below.

The given LLP problem can be solved as below:

Answered: Shipping Costs ($): 3 U.S. Warehouses 4…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section6.5: Set-covering And Location-assignment Models

Problem 34P

See similar textbooks

Similar questions

Suppose there is a transportation model with 4 factories and 6 warehouses. In order to develop an initial solution using the intuitive lowest cost method, do we have to add one or more dummy sources in the transportation matrix, and why?
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…
ASAP PLEASE.. The distribution of goods from the source (factory) to the target (warehouse) will cause problems regarding TRANSPORT, namely how the goods are sent from the factory to the warehouse which produces minimum costs. If it is known that - the capacity of 3 factories is 40000, 30000 and 20000, - the need for 3 warehouses is 20000, 50000 and 30000 respectively. The cost of shipping goods from the factory to the warehouse is shown in the following table Solve the above TRANSPORTATION problems with VAM and MODI
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 transportation costs.Note: "+" denotes supply nodes, and "-" denotes demand nodes.Arrows depict the flow of material and costs.Please provide the mathematical explanation used to solve the question above.
a. set up the transportation tableau for this problem, determine the initial solution using VAM and compute total cost b. solve using MODI c. are there multiple optimal solition? explain, if there are alternative solution, identify them d. formulate this problem as a linear programming model
PharmaCo wants to determine how to deploy sales representatives across its Western U.S. region to support a new drug for obesity. Sales representatives will be located in a "home city", which they serve, in addition to cities with feasible commuting distance, with the objective that all cities must be served by at least one sales representative. The feasible connections between each city in the region are listed below (1 indicates a feasible connection, potential home cities are shown in columns, and cities served in rows): Potential Rep Home City Served? Albuquerque El Paso Denver Phoenix San Diego Los Angeles San Francisco Portland Seattle Las Vegas Salt Lake City Albuquerque 1 1 1 1 0 0 0 0 0 0 0 El Paso 1 1 0 1 0 0 0 0 0 0 0 Denver 1 0 1 1 0 0 0 0 0 0 1 Phoenix 1 1 1 1 1 1 0 0 0 1 1 San Diego 0 0 0 1 1 1 1 0 0 1 0…
PharmaCo wants to determine how to deploy sales representatives across its Western U.S. region to support a new drug for obesity. Sales representatives will be located in a "home city", which they serve, in addition to cities with feasible commuting distance, with the objective that all cities must be served by at least one sales representative. The feasible connections between each city in the region are listed below (1 indicates a feasible connection, potential home cities are shown in columns, and cities served in rows): Potential Rep Home City Served? Albuquerque El Paso Denver Phoenix San Diego Los Angeles San Francisco Portland Seattle Las Vegas Salt Lake City Albuquerque 1 1 1 1 0 0 0 0 0 0 0 El Paso 1 1 0 1 0 0 0 0 0 0 0 Denver 1 0 1 1 0 0 0 0 0 0 1 Phoenix 1 1 1 1 1 1 0 0 0 1 1 San Diego 0 0 0 1 1 1 1 0 0 1 0…
Oranges are grown, picked and then stored in warehouses in Tampa, Miami, and Fresno. Theses warehouses supply oranges to markets in New York, Philadelphia, Chicago, and Boston. The following table shows the shipping costs per truckload (in hundreds of dollars), supply, and Because of an agreement between distributors, shipments are prohibited from Miami to Chicago: Draw a network of this problem. Formulate a linear program for this problem.
PLEASE SHOW ALL FORMULA PharmaCo wants to determine how to deploy sales representatives across its Western U.S. region to support a new drug for obesity. Sales representatives will be located in a "home city", which they serve, in addition to cities with feasible commuting distance, with the objective that all cities must be served by at least one sales representative. The feasible connections between each city in the region are listed below (1 indicates a feasible connection, potential home cities are shown in columns, and cities served in rows): Potential Rep Home City Served? Albuquerque El Paso Denver Phoenix San Diego Los Angeles San Francisco Portland Seattle Las Vegas Salt Lake City Albuquerque 1 1 1 1 0 0 0 0 0 0 0 El Paso 1 1 0 1 0 0 0 0 0 0 0 Denver 1 0 1 1 0 0 0 0 0 0 1 Phoenix 1 1 1 1 1 1 0 0 0 1 1 San Diego 0 0 0 1 1 1…
ii. The problem seeks to minimize total transportation cost. What will be the objective function in terms of x and y?
A company is producing a single product and is selling it through five agencies situated in different cities. All of a sudden, there is a demand for the product in another five cities not having any agency of the company. The company is faced with the problem of deciding on how to assign the existing agencies to dispatch the products to needy cities in such a way that the total travelling distance is minimized. Determine the optimum assignment schedule. The distance between the surplus and deficit cities (in K.M.) is given below. Surplus Cities Deficit Cities A1 B1 C1 D1 E1 A 7 5 9 8 11 B 9 12 7 11 10 C 8 5 4 6 9 D 7 3 6 9 5 E 4 6 7 5 11
A garment producer has three warehouses W1, W2, and W3. These warehouses have 30, 60, and 70 units of their items. Their five retail showrooms at R1, R2, R3, R4, and R5 need 35, 20, 40, 28, and 12 units respectively. Determine the optimum distribution cost. The transport cost in ($ per unit) between every warehouse and every retail showroom is presented in the below table: Warehouse Retail Showroom R1 R2 R3 R4 R5 W1 55 30 40 50 40 W2 35 30 100 45 60 W3 40 60 95 35 30

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS