2. a. Find the starting solution of this transportation method by North-West Method. (Unit transportation costs are given in the table) b. Then find the optimal solution of this transportation method by Stepping Stone Method. D1 D2 D3 D4 Supply M1 8 16 18 20 M2 12 11 13 30 M3 10 5 20 22 15 Demand 20 15 15 20 25

2. a. Find the starting solution of this transportation method by North-West Method. (Unit transportation costs are given in the table) b. Then find the optimal solution of this transportation method by Stepping Stone Method. D1 D2 D3 D4 Supply M1 8 16 18 20 M2 12 11 13 30 M3 10 5 20 22 15 Demand 20 15 15 20 25

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

Obtain the initial basic feasible solution to the following transportation problem using north- west corner rule D1 D2 D3 D4 SUPPLY O1 6 4 1 5 14 O2 8 9 2 7 16 O3 4 3 6 2 5 DEMAND 6 10 15 4 Where O1, O2, O3, O4 are the origins and D1, D2, D3, D4 are requirements respectively. Obtain the minimum cost and comment upon the concept of transportation problem and its significance in detail.
given the transportation problem, assume that the demands at the 4 destinations are 5, 5, 7, and 8 units, respectively, and the supplies at the 4 sources are 7, 3, 7 and 8 units, respectively.C₁₁=7ㅤ C₁₂=9ㅤ C₁₃ = 1ㅤ C₁₄ = 10 C₂₁= 22ㅤ C₂₂ = 25ㅤ C₂₃ = 16ㅤ C₂₄ = 26 С₃₁ = 28ㅤ C₃₂ = 32ㅤ C₃₃ = 24ㅤ Сз₄ = 32 C₄₁ = 12ㅤ C₄₂ = 14ㅤ C₄з = 6ㅤ C₄₄ = 16where m=4, n=4what is the optimal solution using vogel's approximation method, least-cost method, and northwest-corner rule?
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
Draw the network for this transportation problem. (Let xij represent the flow from node i to node j.) Min 2x13 + 4x14 + 6x15 + 8x23 + 11x24 + 9x25 s.t. x13 + x14 + x15 ≤ 500 x23 + x24 + x25 ≤ 400 x13 + x23 = 300 x14 + x24 = 300 x15 + x25 = 300 xij ≥ 0
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…
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?
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…
The network in the figure, shows the routes for shipping cars from three (3) plants (nodes, 1,2 and 3) to three (3) dealers (nodes, 6, 7, 8) by way of two (2) distribution centers (nodes 4and 5). The shipping costs per car (in $100) are shown on the arcs. Solve the problem as a transshipment model.1. Formulate the Linear Programming model 2. Choose one among the three methods for the starting/initial basic solution 3. Solve for the optimal solution using Method of Multipliers
Determine whether the statement is true or false. In a transportation problem with total supply equal to total demand, if there are two origins and three destinations, and there is a unique optimal solution, the optimal solution will utilize 5 shipping routes. True or False
SOLVE THE FOLLOWING PROBLEM OF TRANSPORTATION.Fertimex manufactures fertilizer for general application in 3 different plants located in Acayucan, Ver., Celaya, Gto. andSaltillo, Coah. and sends the final product to 4 different warehouses, 1,2,3 and 4. Since some manufacturing operationshave been around longer than others, there are different production costs at different plants. (TheNewer plants use more modern and up-to-date processes that result in lower costs of ownership.production). The table shows the production costs in pesos per ton and the capacity ofproduction in tons of each plant: Table 1 The requirements in tons of warehouses 1, 2, 3 and 4 are 300, 450, 500 and 600, respectively. Due toSince each warehouse operates separately, the sales prices per ton differ a little, being $62.00,$63.00, $64.00 and $64.00, respectively. How Fertimex managers want to maximize profitscompany totals; for this they must consider the transportation costs associated with the shipment of the…