Define the decision variablesand Write a linear programming model for this problem.B. Use the Northwest-Corner Method, the Least-Cost Method and the VAM to getthe starting feasible solution.ThenFind the optimal solution using the transportation algorithm discussed in class by considering the least optimal of the objective function computed. 3.C.Formulate a network model to illustrate the optimal solution. Consider the transportation table below.Warehouse1SupplyA$2$4$4$1 150Enter your search termFactoryB7 200106.205 15050100150200500500DemandA. Define the decision variables and Write a linear programming model for this problem.B. Use the Northwest-Corner Method, the Least-Cost Method and the VAM to get the starting feasible solution. Then Find the optimalsolution using the transportation algorithm discussed in class by considering the least optimal of the objective function computed.C.Formulate a network model to illustrate the optimal solution.

Warehouse 1 4 Supply A. $2 $4 $4 $1 150 Enter your search term Factory B 7 200 10 C. 6. 20 5 150 50 100 150 200 500 500 Demand A. Define the decision variables and Write a linear programming model for this problem. B. Use the Northwest-Corner Method, the Least-Cost Method and the VAM to get the starting feasible solution. Then Find the optimal solution using the transportation algorithm discussed in class by considering the least optimal of the objective function computed. C.Formulate a network model to illustrate the optimal solution.

Warehouse 1 4 Supply A. $2 $4 $4 $1 150 Enter your search term Factory B 7 200 10 C. 6. 20 5 150 50 100 150 200 500 500 Demand A. Define the decision variables and Write a linear programming model for this problem. B. Use the Northwest-Corner Method, the Least-Cost Method and the VAM to get the starting feasible solution. Then Find the optimal solution using the transportation algorithm discussed in class by considering the least optimal of the objective function computed. C.Formulate a network model to illustrate the optimal solution.

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

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
TRANSPORTATION 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. From/To 1 2 3 3 4 40 60 0 5 6 Dummy 35 M M 0 45 M M 12 20 M 4 15 0 10 30 5 M M 0 15 Demand 300 300 300 150 0 0 0 0 150 Supply 100 200 300 300 300 1,200
1. Central Construction Company moves materials between three plants and three projects. Project A requires 140 truckloads each week, project B requires 200, and project C requires 80. Plant W can supply 120 loads, plant X can supply 160 , and plant Y can supply 140. Using the cost information given in the following table, compute the optimal transportation cost using the stepping-stone method. Cost Information From To project A To project B To project C Plant W $10 $4 $9 Plant X 6. 5 Plant Y 7 4
An entrepreneurial resident of the Oklahoma City metropolitan area is interested in securing a new franchise for Mad Over Donuts. Ideally this franchise would be centrally located so delivery could be economically handled and all citizens could enjoy fresh, delicious donuts delivered to the doorstep. The main cities and anticipated demand (in thousands per day) are shown in Table 2. What is the appropriate (non-linear) objective function for this scenario (hint: distances are euclidean)? Zoey’s Catnip Toys faces the following relationship between price (p) and demand (v): v = 2000 − 200p. The fixed cost is $500 and variable cost is $1. Write an expression for the total profit. What price should Zoey charge to maximize profit in question b.?
A farmers' cooperative association plans to build a new sugar mill in Georgetown. Theprimary objective of the mill is to provide the farmers with a place to take their crop forprocessing that will reduce their transportation costs. The members of the co-op believe thatthe center-of-gravity method is appropriate for this objective. While there are over 200 sugarcane farms in the region, they are tightly clustered around six villages. Using the data below,use the center-of-gravity method to calculate the coordinates of the best location for this mill.All mileage references use Browns Town as (0,0).VillageMiles East ofBrowns TownMiles North ofBrowns TownSugar CanetonnageBarney Valley 90 10 240,000Blue Pasture 140 60 320,000Congo Valley 20 70 450,000Bower 50 20 120,000Rabacca 100 80 60,000Salem 10 120 140,000
Which of the following is NOT a method to develop an initial solution to a transportation model? - Group of answer choices - None...all are methods to develop an initial solution - northwest corner method - linear programming - intuitive least cost method
Consider the transportation table below. (a) Use the Northwest-Corner Method, the Least-Cost Method and the VAM to get the starting feasible solution. (b) Find the optimal solution by considering the smallest value of the objective function computed in (a). Cost to ship one unit from factory 1 to warehouse A A D Supply Factory 1 can supply 100 units per period 100 Factory 2 200 3 150 Total supply capacity per period Demand 4 12 8 B 7 3 10 80 90 Warehouse B can use 90 units per period 120 8 16 160 1 8 5 (450 450 Total demand per period
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.
3. Consider the transportation problem having the following parameter table: Source Demand Source 1 Source 2 650 Source 3 400 1 2 3 Destination 1 Destination 2 500 750 Demand 10 Vj Assume we have obtained an initial BF solution from northwest corner method, it is: X11 = 10, X12 = 2, X22 = 8, X23 = 9, So the initial transportation simplex tableau looks like below. (Boxed values are cost values, X33 = 1, X34 = 10 circled values are basic variable values.) V₁ = Destination 2 750 800 700 10 1 500 650 400 10 10 800 700 10 ܠ ܕܐ 2 3 300 400 500 10 8 400 500 Destination 3 Destination 4 300 450 10 4 450 600 550 10 9 1 600 Supply 12 550 10 V₁ = 17 11 (10 Supply 12 17 11 Ui U₁² 0 = U₂ = Uz = Do the optimality test (by finding out all u₁, v₁, and čij values, fill all these values in the above table) to determine if the current solution is optimal or not.
(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,
The following table presents cost, capacity, and demand data for a transportation problem in Stephanie Robbin’s furniture company. Set up the appropriate transportation table and find the optimal solution using Excel's solver. From/To 1 2 3 Supply A 30 10 5 20 B 10 10 10 30 C 20 10 25 75 Demand 40 60 55 a. Is the problem balanced? [ Select ] ["Yes", "it is balanced", "No", "cannot determine"] , If not, where? [ Select ] ["Neither", "Supply", "Demand"] , and by how much? [ Select ] ["0", "40", "30", "25"] b. What is the optimal cost? $ [ Select ] ["2,500", "1,100", "1,275", "1,300"] c. Were you able to meet all demand requirement? [ Select ] ["no", "cannot determine based on the information given", "yes"] If not, which destination (s) was/were not met? [ Select ] ["none, all destinations were met based on supply and demand being equal", "destination 3 by 30 units", "destination 2 by 30 units", "destination 1 by 25 units…
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