Ok so I have a project in a linear programming class of mine here it is:

I must pick up 40 tennis balls (x,y points) These balls must all be picked up and put in a basket. Please determine the shortest tour that allows you to pick up every ball and return to (0,0). You must begin at (0,0) and you must walk around the net. The net poles are located at (12,39) and (48,39). Show your path on a figure and give the total distance travelled.

So I need to find the shortest distance to pick up the "balls", the grid is essentially a tennis court with a net in the middle. I am sure there is a formula for this but I do not know it, any and all help is greatly appreciated. I have attached the data containing the 40 points, on the left side of the data sheet is the original 40 points sorted x,y descending, on the right hand side is how I have sorted them in the path which I think may be the shortest route.

## Bookmarks