The Traveling Salesman Problem seeks to create a minimum cost $($distance$,$ travel time$)$ route

that visits each customer $($node$)$ in a given set exactly once. The following formulation has been

proposed to solve the problem:

a$)$ Find the solution that will be given by this formulation for the given network of $6$

cities.

b$)$ Does this solution provide a satisfactory traveling salesman tour through the nodes in

the network? If not, design a new constraint that will $$cut$-$out$$ the current solution

and solve again.

c$)$ Does this solution provide a satisfactory traveling salesman tour through the nodes in

the network? If not, design a new constraint that will $$cut$-$out$$ the current solution

and solve again.

d$)$ What happens to the solution cost as we add more constraints?

e$)$ Provide the optimal TSP$.($You can simply write the sequence in which customers are

visited; e$.$g$.1->2->3->4->5->6->1)$