Consider the transportation problem having the following parameter table: Source 1 2 Demand 1 6 5 30 Destination 2 7 8 40 3 4 30 Supply 40 60 Formulate the network representation of this problem as a minimum cost flow problem. Use the northwest corner rule to obtain an initial BF solution. Then use the network simplex method to solve the problem.

Consider the transportation problem having the following parameter table: Source 1 2 Demand 1 6 5 30 Destination 2 7 8 40 3 4 30 Supply 40 60 Formulate the network representation of this problem as a minimum cost flow problem. Use the northwest corner rule to obtain an initial BF solution. Then use the network simplex method to solve the problem.

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

The Maytubig Water Company purifies drinking water in Luzon and Mindanao, which it plans to distribute to typhoon-hit areas in Tacloban, Ilo-ilo, Ormoc, Northern Cebu, and Eastern Samar. The Luzon filtering plant is expected to produce 85,000 liters and the Mindanao filtering plant is expected to produce 50,000 liters a week. These are estimated weekly water requirement according to DSWD: WHOLESALER LITERS OF PURIFIED WATER Tacloban Ilo-ilo Ormoc Northern Cebu Eastern Samar O None of the above Here is the cost of shipping 1,000 liters of purified drinking water from each filtering plant to each affected area: PLANT WHOLESALER COST Luzon Tacloban P 20 Luzon llo-ilo 30 Luzon Ormoc 50 Luzon Northern Cebu 60 Luzon Eastern Samar 35 Mindanao Tacloban 50 Mindanao Ilo-ilo 60 Mindanao Ormoc 20 Mindanao Northern Cebu 30 Mindanao Eastern Samar 70 The distribution cost for the optimal solution is: OP 3,250,000 OP 3,275,000 OP 3,325,000 45,000 25,000 40,000 OP 3,430,000 12,000 20,000
The following network describes a transportation scenario in which there are four sources A, B, C, and D, and three destinations P, Q, and R. (The numbers next to each arrow represent the cost of transporting one unit from that particular source to the destination located at the other end of that arrow). Write the mathematical formulation of the problem. Use the Excel Solver to solve the problem. Generate the answer and sensitivity reports in Excel, and submit your Excel workbook as a separate attachment. Provide the solution obtained in the space provided. What is the optimal cost of transportation?
Please refer to the attached file:
a company's business model was to operate through its facilities- Vancouver, Calgary, Winnipeg, Toronto(ontario), ottawa, Montreal and Halifax. Supply comes from South America, southeast Asia, and Florida. the company was shipping first to Toronto and then to each facility at a total cost of $23095.5 per week. The company is considering the possibility of opening a logistics facility in Miami. Toronto and Vancouver were already available as transshipment centres. What would be the cost savings if Miami centre was opened and what would be the optimal shipment plan?
Explain along with examples related to Freight Traffic Assignment Problems and vehicle routing problem in the logistics activities of manufacturing and service companies! Solve the following case study using the transportation method: Suppose there is a manufacturing company that produces and distributes its products to various customer locations across the country. This company has three production plants (Plant A, Plant B, and Plant C) located in different locations, and there are also five distribution centers (DC 1, DC 2, DC 3, DC 4, and DC 5) scattered across various regions. The company's goal is to determine the most efficient transportation routes for delivering products from the plants to the distribution centers, considering transportation costs and available capacities.
A company manufactures a product at its plants in C and D; then ships the product to its four distribution centers in K, L, M, and N. The transportation costs per unit (in dollars per unit) are as follows: from C to K, L, M, and N: 10, 5, 9, and 20. from D to K, L, M, and N: 2, 8, 30, and 10. The monthly demand from K, L., M, and N are: 3000, 1400, 4000, and 1200 units, respectively. On the other hand, the monthly capacity at plants C and D are: 4100 and 5800 units, respectively. Develop a linear programming model that can be used to determine the distribution plan that will minimize total monthly transportation cost. Use Excel Solver to find the optimal solution The optimal solution shows that the total monthly transportation cost is dollars.
The Rae Mischel Company expanded its shipping capacity and the additional cost of doing this from each warehouse to terminal is highlighted in the following table. Determine theminimum cost to ship from each warehouse to terminal.
A company has three existing warehouses to which it will ship furniture from a new factory whose location must be decided. The factory will receive raw materials from its wood supplier and fabric supplier. The annual number of shipments, shipment costs and the location of the suppliers and warehouses are shown below Existing facilities Annual L to or from fact cost Coordinate location Wood supplier 120 10 (100, 400) Fabric supplier 200 10 (800,700) Ware h 1 61 10 (300, 600) Ware h 2 40 10 (200, 100) Ware h 3 70 10 (600, 200) Using the median load answer the following questions –Where the factory should be located to minimize annual transportation cost –What will be the minimum annual transportation cost
The prices for traveling between five cities in Colorado by bus are given in the table below. Use the edge-picking algorithm to find a low-cost bus route that starts and ends in Boulder and visits each city. Colorado Springs Grand Junction $48 $24 $21 $44 $57 Boulder Denver Boulder $15 Colorado Springs $24 Grand Junction $48 Durango $73 Denver $15 $21 $44 $71 O Boulder-Denver-Colorado Springs-Grand Junction-Durango-Boulder O Boulder-Colorado Springs-Denver-Durango-Grand Junction-Boulder O Boulder-Colorado Springs-Denver-Grand Junction-Durango-Boulder O Boulder-Denver-Colorado Springs-Durango-Grand Junction-Boulder O Boulder-Grand Junction-Colorado Springs-Denver-Durango-Boulder $57 $58 -- $31 Durango $73 $71 $58 $31
Consider the transportation problem having the following parameter table: Source Demand 12 2 Destination 1 8 a6 6 3 2 5 4 3 Supply 4 2 (a) Use the transportation simplex method to solve the above problem
An auto compant currently maintains plants in Cincinnati and Tulsa to supply two distributioncenters in Boston and Phoenix. The production and distribution costs, distribution demands aswell as facility capacities are given in the table attached Using the northwest-corner method, determine the initial allocated quantity for eachshipping route as well as the overall cost.