One of the subclasses of linear programming problems is the transportation problem, the goal of which is to transfer various quantities of a single homogenous item. In order to understand the multi-objective transportation problem, we provide a modified method. The suggested approach is a new row maxima method modification. For various targets, we have taken into consideration min-max arrangement rather than typical. When compared to the new row maximum approach, we obtain a better solution for two of the three objectives in this issue. In the real world, not all transportation issues have a single cause. Multi-objective transportation problems are those that involve several competing and incommensurable goal functions

Transportation, Linear programming, Multi-Objective, Clashing, Maxima