A difficulty in linear programming for transportation problems

Abstract Linear programming has many worthwhile applications to transportation problems of a relatively uncomplicated nature. For inore complicated problems, however, a realistic linear‐programming formulation can require such an excessive number of variables that obtaining a solution is not feasible. This paper shows that an excessive number of variables is usually required when different types of items are to be transported subject to time restrictions and on carriers that can simultaneously handle several items.