Tommy Trojan is a VP of sales who must visit 8 sales offices every month. The...

  

Transcribed Image Text:

Tommy Trojan is a VP of sales who must visit 8 sales offices every month. The following table gives the x-coordinate and y-coordinate of each location relative to location #1, which is the headquarter. Sales Office 1 2 3 4 5 6 7 8 x-coordinate 0.00 1.33 2.32 -1.98 -4.76 -0.68 0.18 -0.7 y-coordinate 0.00 5.73 4.90 2.70 -9.88 -8.23 -7.31 0.02 Find a tour that visits all 8 locations exactly once and has the shortest total distance. The tour must start at location #1 (headquarter), end at location #1, and visit all other locations exactly once. The distance between any two locations is given by the Pythagorean Theorem. What is the optimal tour? What is the minimum distance of the tour? IMPORTANT: You must use SIMPLEX LP to solve this problem. Please create a separate worksheet each time that you add a subtour elimination constraint. Please carefully document your work. Tommy Trojan is a VP of sales who must visit 8 sales offices every month. The following table gives the x-coordinate and y-coordinate of each location relative to location #1, which is the headquarter. Sales Office 1 2 3 4 5 6 7 8 x-coordinate 0.00 1.33 2.32 -1.98 -4.76 -0.68 0.18 -0.7 y-coordinate 0.00 5.73 4.90 2.70 -9.88 -8.23 -7.31 0.02 Find a tour that visits all 8 locations exactly once and has the shortest total distance. The tour must start at location #1 (headquarter), end at location #1, and visit all other locations exactly once. The distance between any two locations is given by the Pythagorean Theorem. What is the optimal tour? What is the minimum distance of the tour? IMPORTANT: You must use SIMPLEX LP to solve this problem. Please create a separate worksheet each time that you add a subtour elimination constraint. Please carefully document your work.