The capacitated transportation-production problem: Computational experience

This paper reports computational experience with the solution of transportation-production problems, using an algorithm designed for transportation problems with nonlinear objective functions. Both uncapacitated and capacitated varieties of the production-transportation problem are solved. Computational results on the former are compared to those reported elsewhere. Also presented are results on the capacitated problem, as far as is known, heretofore not available. Nonlinear problems of size up to 25×100 are solved efficiently in CPU times ranging from 5 to 30 seconds. Many extensions to the linear transportation problem which already exist in the literature are applicable to the nonlinear model presented in this paper. Thus, the authors conclude that the solution technique provided here is an important step in finding solutions to a wide range of managerial problems.