BUILD A COMPLETE TSP FORMULATION Develop a

mathematical model that will identify a tour whose length of

longest arc is minimized. AND IDENTIFY THE OBJECTIVE

FUNCTION AND THE CONSTRAINTS AND ANY OTHER

NECESSARY DETAILS

Since Mars is a harsh place, long journeys between two outposts $($or an outpost and a settlement$)$ as

part of a tour should be avoided to minimize risks $($getting lost in a dust storm, prolonged exposure

to cosmic radiation$).$ Therefore, HME would also like your team to come up with an alternative tour

design to deliver resources to the outposts. The alternative tour design should ensure that the longest

connection chosen in the tour between any two outposts is minimized. Note that there is no restriction

on the length of the connections between the settlement and any outpost in the tour, and that the goal

is to minimize the longest connection between any two outposts in the tour.