AbstractTransportation problems with inadmissible routes (routes that cannot be used) need not have a feasible solution, even if the total supply exceeds the total demand. A method for adjusting the demands equitably to obtain a feasible solution is presented. The algorithm used generates a feasible minimum cost solution in roughly twice the amount of time that it would take to solve a transportation problem of the same size. It is shown how the solution time is reduced by aggregating the adjustment of demands and decomposing the cost minimization.