Five warehouses currently have the following cooordinate locations: P = (1, 1), P = (6,2), P3...

 

Transcribed Image Text:

Five warehouses currently have the following cooordinate locations: P₁ = (1, 1), P₂ = (6,2), P3 = (2,8), P4 = (3,6), P5 = (8,4). • The cost per unit distance traveled between the new warehouse and each existing warehouse is the same. The number of trips per month between the new warehouse and existing warehouse 1, 2, 3, 4, 5 are 10, 20, 25, 20, 25, respectively. a. Find the optimum location for the new warehouse. b. If it is impossible to locate the new warehouse in the optimum location. Instead, there are three feasible locations: Q₁ (3,5), Q2 = (4, 5), and Q3 = (2, 4). Which is preferred? Five warehouses currently have the following cooordinate locations: P₁ = (1, 1), P₂ = (6,2), P3 = (2,8), P4 = (3,6), P5 = (8,4). • The cost per unit distance traveled between the new warehouse and each existing warehouse is the same. The number of trips per month between the new warehouse and existing warehouse 1, 2, 3, 4, 5 are 10, 20, 25, 20, 25, respectively. a. Find the optimum location for the new warehouse. b. If it is impossible to locate the new warehouse in the optimum location. Instead, there are three feasible locations: Q₁ (3,5), Q2 = (4, 5), and Q3 = (2, 4). Which is preferred?

Answer rating: 100% (QA)

SOLUTION For part a we need to find the location that minimizes the total cost of transportation between the new warehouse and the existing warehouses We can use linear programming to solve this probl... View the full answer