Main Article Content
In this paper, a more-for-less (MFL) paradox situation is discussed for a multiobjective transportation problem with linear and fractional objective function. By using the MFL paradox in multi-objective programming, we can transfer more goods from source to destination with less or equal compromise optimal solution. In this approach, it is not necessary that a paradox is present in every objective. If a paradox is found in one of the objectives, then we can use this approach. We compare the paradoxical solution with compromise solution using ranking procedure  and show the superiority of the proposed paradoxical approach. For proper explanation of theory two examples are discussed.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.