For the following transportation problem find the optimal Solution by using :Multipliers method : For the following transportation problem find the optimal Solution by using Multipliers method: 3 2 1.7 supply 1.8 2.5 1 100 300 400 2.8 1.8 1.4 2 200 300 500 demand 300 300 300

For the following transportation problem find the optimal Solution by using :Multipliers method : For the following transportation problem find the optimal Solution by using Multipliers method: 3 2 1.7 supply 1.8 2.5 1 100 300 400 2.8 1.8 1.4 2 200 300 500 demand 300 300 300

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

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?
Consider the following LP problem: Min 6X+ 27Y Subject to : 2 X + 9Y => 25, and X + Y <= 75. Pick a suitable statement for this problem: a. X=37.5, Y=37.5 is the only optimal solution. b. Optimal Obj. function value is 75 c. X = 0, Y = 0 is the only optimal solution. d. Optimal Obj. function value is 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
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
1. True/FalseA company wants to hire 4 vendors for the sale of 4 products, they could only sell one type of product. The following table (image) indicates what each seller charges for selling each of the products. The company wants to assign each seller a product, find all possible optimal assignments by pinpointing their optimal cost. answer the following:a) It is an allocation model T() F()b) It is not a transportation model T() F()c) The model is not balanced T() F()d) The problem has exactly 24 feasible points T() F()
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? 2. Provident Capital Corp. specializes in investment portfolios designed to meet the specific risk tolerances of its clients. A client contacted Provident with P2,000,000 available to invest. Provident’s investment advisor recommends a portfolio consisting of two investment funds: the Dynamic fund and the Diversified fund. The Dynamic fund has a projected annual return of 10%, and the Diversified fund has a projected annual return of 8%. The investment advisor requires that at most P1,400,000 of the client’s funds should be invested in the Dynamic fund. Provident’s services include a risk rating for each investment alternative. The Dynamic…
Consider the following linear programming model with 4 regular constraints:Maximize 3X + 5Y (a) Draw your graph in the space below:subject to: 4X + 4Y ≤ 48 (constraint #1) 4X + 3Y ≤ 50 (constraint #2) 2X + 1Y ≤ 20 (constraint #3) X ≥ 2 (constraint #4) X, Y ≥ 0 (non-negativity constraints)(a) Which of the constraints is redundant? Constraint #______.Justify by drawing a graph similar to Figure 7.14 on p.263.(b) Is point (9,3) a feasible solution? _____. Explain your answer (by analyzing each of the constraints).Constraint #1: _______________________________________________________________Constraint #2: _______________________________________________________________Constraint #3: _______________________________________________________________Constraint #4: ______________________________________________________________
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
2. Optimal solutionA company wants to hire 4 vendors for the sale of 4 products, they could only sell one type of product. The following table (image) indicates what each seller charges for selling each of the products. The company wants to assign each seller a product, find all possible optimal assignments by pinpointing their optimal cost. Indicate which is the optimal solution and the optimal value: a) Seller 1 is assigned product 2, seller 2 is assigned product 4, seller 3 is assigned product 3, and seller 4 is assigned product 1. For an optimal cost of 15 b) Seller 2 is assigned product 1, Seller 4 is assigned product 2, Seller 3 is assigned product 3, and Seller 1 is assigned product 4. For an optimal cost of 15 c) Seller 1 is assigned product 2, seller 2 is assigned product 4, seller 3 is assigned product 3, and seller 4 is assigned product 1. For an optimal cost of 14 d) None of the above
(5) Consider the following linear programming model with 4 regular constraints:Maximize 3X + 5Y (a) Draw your graph in the space below:subject to: 4X + 4Y ≤ 48 (constraint #1) 4X + 3Y ≤ 50 (constraint #2) 2X + 1Y ≤ 20 (constraint #3) X ≥ 2 (constraint #4) X, Y ≥ 0 (non-negativity constraints)(a) Which of the constraints is redundant? Constraint #______.Justify by drawing a graph similar to Figure 7.14 on p.263.(b) Is point (9,3) a feasible solution? _____. Explain your answer (by analyzing each of the constraints).Constraint #1: _______________________________________________________________Constraint #2: _______________________________________________________________Constraint #3: _______________________________________________________________Constraint #4: _______________________________________________________________(c) Which of the following points yields the best solution? Underline the best solution: (7,5), (9,2), (6,6).Justify your answer (using the data from the above LP…
Find the optimal solution for the following problem. (Round your answers to 3 decimal places.) Maximize C = 14x + 13y + 5z subject to 9x + 11y + 18z ≤ 61 14x + 15y + 12z ≤ 122 and x ≥ 0, y ≥ 0, z ≥ 0. What is the optimal value of x? What is the optimal value of y? What is the optimal value of z? What is the maximum value of the objective function?
Find the optimal solution for the following problem. (Round your answers to 3 decimal places.) Minimize C = 14x + 7y + 8z subject to 6x + 12y + 19z ≥ 64 17x + 24y + 9z ≥ 128 and x ≥ 0, y ≥ 0, z ≥ 0. What is the optimal value of x? What is the optimal value of y? What is the optimal value of z? What is the minimum value of the objective function?