A New Approach for More-For-Less Paradox in the Linear Fractional Transportation Problem
The more-for-less (MFL) situation occurs in the linear fractional transportation problem (LFTP) when we are able to increase total shipment for less (or same cost) total cost. In this paper we develop a simple step by step procedure to solve MFL situation in LFTP. The main advantage of the algorithm is that it never changes the initial basis. This method is based on optimal solution of LFTP and theory of shadow prices. At the end, a numerical example is discussed to explain the proposed algorithm.
- There are currently no refbacks.