Question 1 100 pts Instructions: Read carefully and answer the following problems. Prepare a document to present your solutions. The approaches (models, formulas, others) must be included in the file. The correct answers without a statement will not be considered for the grading. Submit all the additional files you used to solve the exam. Using the following information, define the distribution plan for the warehouse located in (50,35). The location of each customer is shown in the following table: Coordinates Nodes Customer requirements (x,y) 1 (10.30) 150 2 (50.80) 110 3 (20.20 210 4 (30,30) 100 5 (40.100) 410 6 (70,80 200 7 (35.15) 345 8 (25.70) 280 9 (38,90) 255 10 195.100) 310 1. Represent the problem as a linear programming model. Consider only one vehicle with a capacity of 3000 units. Include everything you need in the file. Use (15 pts) 2. Determine the best route considering the information of point 1. Euclidean distances (15 pts) 3. Consider that only 3 trucks are available, each with a capacity of 1000 units. Define a sequence of the routes for each of both methods sweep and savings (Clark and Wright). Feel free to add an extra vehicle in case is needed. (30 pts). 4. Improve your previous solution using the Nearest Neighbor. (15 pts.) 5. Based on your answers (from points 3 and 4), determine the best route for this exercise and the percentage of improvement considering the initial solutions (point 3) (10 pts). 6. Explain briefly how does the sweep method Mention 1 disadvantage comparing with the savings method. (10 pts) Upload Choose a File Question 1 100 pts Instructions: Read carefully and answer the following problems. Prepare a document to present your solutions. The approaches (models, formulas, others) must be included in the file. The correct answers without a statement will not be considered for the grading. Submit all the additional files you used to solve the exam. Using the following information, define the distribution plan for the warehouse located in (50,35). The location of each customer is shown in the following table: Coordinates Nodes Customer requirements (x,y) 1 (10.30) 150 2 (50.80) 110 3 (20.20 210 4 (30,30) 100 5 (40.100) 410 6 (70,80 200 7 (35.15) 345 8 (25.70) 280 9 (38,90) 255 10 195.100) 310 1. Represent the problem as a linear programming model. Consider only one vehicle with a capacity of 3000 units. Include everything you need in the file. Use (15 pts) 2. Determine the best route considering the information of point 1. Euclidean distances (15 pts) 3. Consider that only 3 trucks are available, each with a capacity of 1000 units. Define a sequence of the routes for each of both methods sweep and savings (Clark and Wright). Feel free to add an extra vehicle in case is needed. (30 pts). 4. Improve your previous solution using the Nearest Neighbor. (15 pts.) 5. Based on your answers (from points 3 and 4), determine the best route for this exercise and the percentage of improvement considering the initial solutions (point 3) (10 pts). 6. Explain briefly how does the sweep method Mention 1 disadvantage comparing with the savings method. (10 pts) Upload Choose a File