operations research1 - linear programming -transportationI need help please Given the following transportation matrix where the numbers in the cells represent cost of transporting 1unit from a specific source to a specific destination, determine the initial solution using the 3 methods anddetermine the optimum solution by using the initial solution with the lowest value of Z.From/To 3 4Dummy Supply1005_4060135MM45MM20031220M30041510303005MM15300Demand 300 300 300 1501501,200

Find the Given details below: Given details: From/To 3 4 5 6 Dummy Supply 1 40 35 M M 0 100…

Answered: Given the following transportation…

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 35P

See similar textbooks

Similar questions

Given the following transportation matrix where the numbers in the cells represent cost of transporting 1unit from a specific source to a specific destination, determine the initial solution using the 3 methods anddetermine the optimum solution by using the initial solution with the lowest value of Z.
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…
a.Find the starting solution of this transportation model by Least Cost Method. (Unit transportation costs are given in the table) Then find the optimal solution of this transportation model by Stepping Stone Method. D1 D2 D3 D4 Supply M1 16 24 14 11 25 M2 21 18 17 9 30 M3 15 13 21 14 40 Demand 25 25 20 25
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?
The more sources and destinations there are for a transportation problem, the smaller the percentage of all cells that will be used in the optimal solution. Explain.
Explain how to determine the number of variables and constraints that would be in a transportation problem simplyby knowing the number of sources and the number of destinations.
The optimal solution to the original Grand Prix problem indicates that with a unit shipping cost of $132, the route from plant 3 to region 2 is evidently too expensive—no autos are shipped along this route. Use SolverTable to see how much this unit shipping cost would have to be reduced before some autos would be shipped along this route.
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
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.
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
Suppose the company has received a proposal for setting up another warehouse(Warehouse E) with a capacity of 900 units. The location of the warehouse is such thatthe unit costs of transporting to the six cities are as follows: Hyderabad–45, Mysore–75, Chennai–30, Kochi–65, Pune–90 and Vizag–80. The company would like to knowhow the allocation will change if the warehouse is made operational and the likely costimpact on the operation of the system. After balancing above table by which method we should solve this problem
Consider the transportation problem having the following data: c) write the algebraic formulation of this problem.

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