TRANSPORTATION PROBLEMS WITH TWO SIDED CONTRAINTS ON SUPPLIES AND DEMANDS

Abstract

The transportation problem with given fixed supplies and demands is well known in the linear optimization theory (see, for instance [1, 3]). It has various applications in the real world and has been widely studied. The purpose of this paper is to develop a new and rather simple algorithm for solving the problem in the case where supplies and demands of stores and destinations have not been fixed, but changed in a given interval. The algorithm relies on reducing the original problem to an ordinary transportation problem with a few bounded variables. This algorithm is a further extension of the one presented in [2] for the case where only supplies or demands can be changed.