In this paper, primal-dual and information recycling properties have been used for solving a transhipment model. The primal-dual concept in linear programming has been used extensively, but its usage in context of a transhipment model is not widespread. The advantage of the primal-dual approach is that a primal-dual feasible solution need not be subjected to any test of optimality. This approach is also useful in solving a protean transhipment problem. The proposed technique concludes optimality of a solution without the optimality test; hence, it is likely to be computationally efficient. This aspect of computational efficiency requires software development and testing on various size problems.