TRANSPORTATIONGiven 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/To1233 4406005 6 Dummy35 MM045 MM12 20 M4150 10 305MM0 15Demand 300 300 300 1500000150Supply1002003003003001,200

The matrix provided in the question will be solved with 3 methods namely: 1. Northwest Corner Rule…

Answered: TRANSPORTATION Given the following…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section: Chapter Questions

Problem 2C

See similar textbooks

Similar questions

Given the following transportation matrix where the numbers in the cells represent cost of transporting 1 unit from a specific source to a specific destination, determine the initial solution using the 3 methods and determine the optimum solution by using the initial solution with the lowest value of Z. 3 4 5 6 35 Dummy Supply From/To 1 40 M M 100 60 45 M M 200 12 20 M 300 4 15 10 30 300 5 M M 15 300 Demand 300 | 300 300 150 150 1,200
TRANSPORTATION . Given the following transport. tion matrix where the numbers in the cells represent cost of transporting 1 unit from a specific source to a specific destination, determine the initial solution using the 3 methods and determine the optimum solution by using the initial solution with the lowest value of Z. 3 4 40 35| M M 20 30 From/To 5 6 Dummy | Supply 1 M 100 60 45 M 200 3 12 M 300 4 15 10 300 5 M M 15 300 Demand 300 300 300 | 150 150 1,200
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.
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
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…
Using the the 3 methods: Vogel's Approximation Method, Northwest Corner Method and Minimum Cost Method what is the total transportation cost per method?
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.
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 following cost information, solve for the optimal transportation cost: Use MODI Method At the third solution, what is the value of R3? At the third solution, what is the value of K3? How much is the cost of the third solution?
(b)Consider a transportation model with m sources and n destinations. Describe briefly how you can resolve the following situations while solving the problem: (i) Total supply is greater than total demand,
Given the following cost information, solve for the optimal transportation cost: Use MODI Method How much is the cost of the initial solution? How much is the cost of the second solution? At the initial solution, what is the value of R4? At the initial solution, what is the value of K4?
Determine an initial basic feasible solution to the following transportation problem by using (a) NWCM, (b) LCM, and (c) VAM

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