9. Solve the foliowing transportation problem:DestinationSourceSupply23411518221630ति2151920144031316231730Demand20202535100Is the optimal solution obtained by you a unique one? If not, why? What are the alternate optima then? 10. A company has four warehouses and five stores. The warehouses have total surplus of 430 units of agiven commodity that is divided among them as follows:WarehouseW1W2W3WAelooles moSurplus15030120130The five stores have, in all, a requirement of 450 units of the commodity. Individual requirements areStoreS2S3S4SsRequirement80602021080Cost of shipping one unit from the ith warehouse to the jth store is as displayed in the following table:StoreWarehouseS3S4SsWi1210106.iminW d1812112ca woflW3uleInitiinoi MA T0 feto2010M73W4562M8M in this table indicates that the route is not available.How should the company arrange to transport the units so that the transportation cost is minimised?

Since you have posted a two question, we will solve the first question for you. To get remaining…

9. Solve the following transportation problem: Destination Source Supply 3 4 1 15 18 22 16 30 2 15 19 20 14 40 3 13 16 23 17 30 Demand 20 20 25 35 100 Is the optimal solution obtained by you a unique one? If not, why? What are the alternate optima then?

9. Solve the following transportation problem: Destination Source Supply 3 4 1 15 18 22 16 30 2 15 19 20 14 40 3 13 16 23 17 30 Demand 20 20 25 35 100 Is the optimal solution obtained by you a unique one? If not, why? What are the alternate optima then?

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

Explain in detail Consider a balanced transportation problem with the cost of transportation Cij given by: C11=10,C12=0,C13=20,C14=11C11=10,C12=0,C13=20,C14=11, C21=12,C22=7,C23=9,C24=20C21=12,C22=7,C23=9,C24=20 , C31=0,C32=14,C33=16,C34=18C31=0,C32=14,C33=16,C34=18, with the current basic feasible solution (BFS): x12=15,x22=0,x23=15,x24=10,x31=5,x34=0x12=15,x22=0,x23=15,x24=10,x31=5,x34=0. Then Select one: a)current solution is not optimal and x24x24 is a leaving variable b)None of these c)the current BFS is optimal d)current solution is not optimal and x23x23 is a leaving variable
In a 3 x 3 transportation problem, let xij be the amount shipped from source i to destination j and let cij be the corresponding transportation cost per unit. The amounts of supply at sources 1, 2, and 3 are 15, 30, and 85 units, respectively, and the demands at destinations 1, 2, and 3 are 20, 30, and 80 units, respectively. Assume that the starting northwest-corner solution is optimal and that the associated values of the multipliers are given us u1 = -2, u2 = 3, u3 = 5, v1 = 2, v2 = 5, and v3 = 10. a) Find the associated optimal cost. b) Determine the smallest value of cij for each nonbasic variable that will maintain the optimality of the northwest-corner solution.
Two plants supply three customers with medical supplies. The unit costs of shipping from the plants to the customers, along with the supplies and demands, are given in Table below. The company’s goal is to minimize the cost of meeting customers’ demands. From To Customer 1 Customer 2 Customer 3 Supply Plant 1 55 65 80 35 Plant 2 10 15 25 50 Demand 10 10 10 Formulate a linear programming (LP) model for this problem. Use solver to find the optimal transportation rule As a management science student, the MD of the company seeks your expert advice on ways in which to determine the optimal transportation rule. Advise the MD, providing detailed explanation using your answer obtain in (b). Write your answer in a form of a report to the MD.
Problem 7-14 (pg 278)    Using the following equations, graph the constraints and solve using the corner point approach ONLY. Let: X1 = number of air conditioners to be produced X2 = number of fans to be produced Maximize profit = 25X1 + 15X2 subject to 3X1 + 2X2 <= 240 (wiring)                2X1 + 1X2 <= 140 (drilling)                      X1, X2 >= 0
(a) Write the dual of the following linear programming problem: Maximize       Ζ = 3x1 + 5x2 + 4x3, Subject to      2x1 + 3x2 ≤ 8, 2x2 + 5x3 ≤10 3x1 + 2x2 + 4x3 ≤15 x1 , x2 , x3 ≥ 0 (b) Find the optimal solution to the given problem in (a) above, using the simplex method. (c) From the final optimal table in (b) above, find the solution to the dual problem. (d) Give the economic interpretation to the solution in (c) above.
1. Given the following linear programming model: Minimize Z = 480x1 + 160x2 subject to   x1 + x2 >= 40   x1 + 4x2 >= 60 3x1 + x2 >= 60   x1 >= 0,  x2 >= 0 a. Solve the LP model graphically and explain the solution result. b. Develop a spreadsheet model and solve using Excel Solver. What is the optimal solution?
Given this linear programming model, solve the model and then answer the questions that follow.Maximize Z = 12x1 + 18x2 + 15x3 where x1 = the quantity of product 1 to make, etc.Subject toMachine 5x1 + 4x2 + 3x3 ≤ 160 minutes Labor 4x1 + 10x2 + 4x3 ≤ 288 hoursMaterials 2x1 + 2x2 + 4x3 ≤ 200 poundsProduct 2 x2 ≤ 16 units x1, x2, x3 ≥ 0 a. Are any constraints binding? If so, which one(s)?
Solve the following problem after finding its dual. Min z = x1 - 3x2 + 3x3 s.t. 3x1 - x2 + 2 x3 ≤ 7 2x1 + 4x2 ≥ -12 -4x1 + 3x2 + 8x3 ≤ 10 x1, x2, x3 ≥ 0
Set up the simplex matrix used to solve the linear programming problem. Assume all variables are nonnegative.Maximize f = 5x + 9y subject to 8x + 5y ≤ 200 x + 6y ≤ 250. x y s1 s2 f first constraint second constraint objective function
1. Consider the following linear programming formulation: Min 5x + 2y Subject to (1) 3x + 6y ≥ 18 (2) 5x + 4y ≥ 20 (3) 8x + 2y ≥ 16 (4) 7x + 6y ≤ 42 (5) x, y ≥ 0 a. Solve the problem graphically. Specifically, show each constraint and the feasible region, draw an objective function line and identify an optimal point (the solution). When reporting the optimal solution and the corresponding objective function value, you may estimate the optimal x and y values from the graph. b. What are the optimal values of x and y, using the solver add-in? What is the corresponding value of the objective function? c. How many extreme points does the feasible region have? Enumerate them. Hint: It's from the graph. d. Change the objective function to 15x + 12y.. What is the new optimal solution(s)?
The following table shows the cost to ship goods from Factory 1,2,3 to Warehouse A,B,C: We will designate "F" as the variable for Factory. The constraint that represents the quantity supplied by Factory 1 should be written as: A)F1A+F1B+F1C=500 B)4F1A+6F1B+8F1C<=500 C)F1A+F1B+F1C<=500 D)F1A+F1B+F1C>=500 E)F1A+F2A+F3<=200
Consider the following linear programming problem: Min Z = 50x1 + 60x2 s.t. 6x1 + 5x2 >= 30 8x1+4x2 >= 32 x1,x2 >=0. What is the Z in the optimal point of this problem? a. 200 b. 250 c. 300 d. 350 e. none of the abov