TRANSPORTATION ALGORITHM

Q$1.$ Consider the following transportation problem. The number in the cell is the cost, the number left of

each row is the supply and the number below each column is the demand.

i$)$ Formulate the problem as a linear program. $(10$ points$)$

ii$)$ Start with a feasible solution generated using all three methods: Northwest$-$corner, Least$-$

cost$,$ and VAM. $(30$ points$)$

iii$)$ Select the best starting solution from $($ii$)$ then find the optimal solution. Show all the

steps. $(10$ points$)$