Linear Programming with a branch and bound algorithm was used to solve the travelling salesman problem. Given the latitude and longitude