Solving transshipment problems with mixed constraints

Abstract

In this article we have considered a generalization of the standard transshipment model in which the origin and destination constraints consist not only of equality but also of greater than or equal to or less than or equal to type constraints The proposed algorithm solves the original transshipment problem by transforming the problem into an equivalent transportation problem by introducing an additional row and a column. The optimal solution of the original transshipment problem is obtained from the optimal solution of the transformed transportation problem. We have discussed the case of both balanced as well unbalanced transshipment problems. The proposed algorithm is easy to understand and apply. It can serve the managers by providing the solution to a variety of distribution problems with mixed constraints and in paradoxical situations. A detailed numerical example to illustrate the proposed algorithm is also presented.