Math340/Week 6

Question 1 (Tuesday June 16)

Consider the a delivery company with two different trucks $T_{1},T_{2}$ and three routes $r_{1},r_{2},r_{3}$.

Suppose $T_{1}$ can only be used for the first two routes, while $T_{2}$ can be used for all three.

Given the cost $c_{i,j}$ of assigning $T_{i}$ to $r_{j}$, write the problem of minimizing the total cost as an integer programming problem.

Question 2 (Wednesday, June 17)

On the previous homework you found that when adding a worker to the casting department of our toy factory the optimal solution is non integer. Determine the optimal solution if we require a production of an integer number of each toy using the branch and bound algorithm (Ch 23 in Vanderbei).