Question: 1. Our exposition of scaling disregards the possibility of one or more approximations being infeasible, even though the original problem is feasible. Find a way of getting around this obstacle.
2. Show that the problem of finding shortest paths from a fixed node to all the remaining nodes can be turned into a transshipment problem.