New Row Maxima Method to Solve Multi-Objective Transportation Problem using C – Programme and Fuzzy Technique

The transportation problem is one of the sub-classes of linear programming problems in which the objective is to move different amounts of a solitary homogeneous items. We propose a modified algorithm for fathoming MOTP. Proposed method is a modified method to new row maxima method. Rather than considering normal we have considered min-max arrangement for multiple objectives. In this problem we get improved answer for two of the three objectives when contrasted with new row maxima method.In the genuine circumstance, all transportation problems are not single objective. The transportation problem includes multiple clashing and incommensurable objective functions are called as multi-objective transportation problem.