Question

In: Statistics and Probability

Find the optimal solution for the mini-sum location model assuming: (a) squared Euclidean distances; (b) Euclidean...

Find the optimal solution for the mini-sum location model assuming: (a) squared Euclidean distances; (b) Euclidean distances. For each case find the optimal location of a new machine, assuming existing machines located at (4, 3), (7, 5), (11, 8), and (13, 4) with weights equal to 1/3, 1/6, 1/3, and 1/6, respectively?.

Solutions

Expert Solution

Solution

Given

Machine Number Location Weights

Machine 1 (4,3) 1/3

Machine 2 (7,5) 1/6

Machine 3 (11,8) 1/3

Machine 4 (13,4) 1/6

Now arrange the machines in the increasing order of their x-coordinates

Machine Number ai (x-coordinates) wi Sigma wi Machine Number bi wi sigma wi

M1 4 1/3 1/3 M1 3 1/3 1/3

M2 7 1/6 1/2 M4 4 1/6 1/2

M3 11 1/3 5/6 M2 5 1/6 2/3 M4 13 1/6 1 M3 8 1/3 1

x-coordinate for the new location = sigma wi/2 = 1/2 y-coordinate for the new location = sigma wi/2 =1/2

min

Now using the above formula

a) Squared Euclidean distances

1/3 x (4- 1/2)^2 + 1/2 x (7-1/2)^2 + 1/3 x (11-1/2)^2 + 1/6 x (13-1/2)^2

=2112/24 = 88

88 is the new x-coordinate

for the y-coordinate

1/3 x (3-1/2)^2 + 1/2 x ( 4-1/2)^2 + 2/3 x (5-1/2)^2 + 1/3 x (8-1/2) ^2

= 971/24 = 40.46

So, the new location is (88, 40.46)

b) Euclidean distance

1/3 x sqrt((4- 1/2)^2) + 1/2 x sqrt((7-1/2)^2 )+ 1/3 x sqrt ((11-1/2)^2) + 1/6 x sqrt((13-1/2)^2)

=10

1/3 x sqrt((3-1/2)^2) + 1/2 x Sqrt(( 4-1/2)^2) + 2/3 x sqrt((5-1/2)^2) + 1/3 x sqrt((8-1/2) ^2)

=8.08

So, the new location coordinates are (10, 8.08)


Related Solutions

Find a point within a triangle such that the sum of the square of its distances...
Find a point within a triangle such that the sum of the square of its distances from the three angular points is a minimum.
Four dice are tossed. Find the probability that (a) the sum is 10, (b) the sum...
Four dice are tossed. Find the probability that (a) the sum is 10, (b) the sum is 15, (c) two dice comes up 1 and two dice come up?
Find an optimal solution to the following transportation problem. ?????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????? Copy to Clipboard + ?? To...
Find an optimal solution to the following transportation problem. ?????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????? Copy to Clipboard + ?? To From A B C Supply X ?$10 ?$19 ?$12 150 Y ?$17 ?$13 ?$9 100 Z ?$20 ?$18 ?$14 50 Demand 80 120 60 Based on the given demand and? supply, the given transportation problem is ? balanced unbalanced .Before finding the initial? solution, a dummy ? supplier destination should be introduced.The total cost of the optimal solution? = ?$
If you add a constraint to an optimization model, and the previously optimal solution satisfies the...
If you add a constraint to an optimization model, and the previously optimal solution satisfies the new constraint, will this solution still be optimal with the new constraint added? Why or why not?
You are a manager that uses Excel to find the optimal solution to a linear programming...
You are a manager that uses Excel to find the optimal solution to a linear programming problem. Before implementing the solution, what should you do?
Find the following values for a lump sum assuming annual compounding: Consider an uneven cash flow...
Find the following values for a lump sum assuming annual compounding: Consider an uneven cash flow stream: Find the following values assuming a regular, or ordinary, annuity: The present value of $400 per year for ten years at 10 percent The future value of $400 per year for ten years at 10 percent The present value of $200 per year for five years at 5 percent The future value of $200 per year for five years at 5 percent The...
Use the branch and bound method to find the optimal solution to the following integer programming...
Use the branch and bound method to find the optimal solution to the following integer programming problem: maximize 7x1 + 3x2 subject to: 2 x1 + x2 < 9 3 x1 + 2x2 <13 x1, x2 > 0; x1, x2 integer Instead of using EXCEL Solver to solve this problem directly as an integer programming problem, use EXCEL Solver to solve the LP problems at each branch, with the appropriate constraints added, according to the branch and bound algorithm. Be...
Use the graphical method for linear programming to find the optimal solution for the following problem....
Use the graphical method for linear programming to find the optimal solution for the following problem. Maximize P = 4x + 5 y subject to 2x + 4y ≤ 12                 5x + 2y ≤ 10 and      x ≥ 0, y ≥ 0. graph the feasible region
Find the optimal values of x and y using the graphical solution method: Max x +...
Find the optimal values of x and y using the graphical solution method: Max x + 5y subject to: x + y ≤ 5 2x + y ≤ 8 x + 2y ≤ 8 x ≥ 0, y ≥ 0
To find the optimal solution to a linear optimization problem, do you have to examine all...
To find the optimal solution to a linear optimization problem, do you have to examine all the points in the feasible region? Explain. Can a linear programming problem have no solution? More than one solution? Explain. ---------------------------------------------------------------------------------------------------------------- A beverage can manufacturer makes three sizes of soft drink cans—Small, Medium and Large. Production is limited by machine availability, with a combined maximum of 90 production hours per day, and the daily supply of metal, no more than 120 kg per day....
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT