INSTRUCTIONS

Dalailam Company is a distributor of energy drinks and sales team of Dalailam Company has five cities

to visit next week. Distances between cities are given in Table $5\mathrm{.}1.$

Table $5\mathrm{.}1$: The distance matrix for cities to be visited $($in kilometers$)$

Assuming that sales team will start from city $1$ and visit each city only once, they will create a

Hamiltonian tour. Accordingly, please apply a branch$-$and$-$bound $($B&B$)$ algorithm, in which

subproblems reduce to an assignment problem, and find optimal solution for Dalailam's sales team.

While applying $B$&$B,$ please show $B$&$B$ tree, and incumbent solution and constraint to be added at

each iteration. Please use GAMS to find the solution at each subproblem and report them along with

your answers.

Please submit your work via Blackboard including a small report $($please use word

equations or LaTex$)$ and a GAMS file.