Interval Versions of Max-Min Method for Solving the Multi Objective Interval Transportation Problem

In this paper we discuss a multi-objective question of transport, where the parameters of source and destination are chosen as interval numbers. We are proposing a new algorithm for the initial feasible basic solution of multi-objective interval transport problem (IBFS). The initial feasible simple solution obtained in the proposed solution is much similar to the optimal solution. A numerical illustration to demonstrate the efficacy of the proposed method is given.