Answer the following three parts of the problem. Parts A and B are worth 30% each while part C is worth 40% of the overall mark for this problem.
A. Formulate a linear programming model to determine the minimum cost transportation schedule.
Explain clearly the variables you use and the constraints you construct. What is the minimun cost transportation schedule and what are the corresponding costs?
B. Discuss the effect on the minimum transportation cost when capacity at each factory or warehouse is altered by adding or subtracting one ton. What are the minimum capacity changes at Glasgow that will alter the optimum set of routes and what will those alterations be? Explain how you arrive at each one of your answers.
C. The management of the company is considering the possibility of closing down one of the warehouses as this is expected to result in substantial labour and maintenance savings.
Further, the manager of the Birmingham warehouse is considering sub–letting some of the capacity of this warehouse. Such sub–lets would have to be in exact multiples of 1000 tons.
It is estimated that each 1000 tons of capacity could be let for £21,000 per week. Formulate a mixed integer linear programming model – or, if necessary, different model variants – to examine and evaluate the alternative courses of action. What would you recommend the company to do, and why?
Discuss the alternatives, also taking into account the solution from part (a) and explain which additional information you might need (if any) to give the company more specific advice.