• ZERO SUFFIX METHOD FOR THE TRANSSHIPMENT PROBLEM WITH MIXED CONSTRAINTS

Abstract

A method, namely zero suffix method is proposed to solve the transshipment problem with mixed constraints. Standard  transshipment model in which the origin and destination constraints consists not only of the equality sign but also of greater than or equal to, or less than or equal to type constraints, is termed as transshipment problem with mixed constraints. Transshipment problem with mixed constraints is transformed into an equivalent classical transportation problem by introducing an additional row and column. The classical transportation problem is then solved by zero suffix method. The solution tested through modi-indices declares an optimal solution. Method is structured in the form of algorithm and illustrated through a numerical example.