More-For-Less Paradox in a Solid Transportation Problem

Abstract

In this paper, we discuss more-for-less paradox in a solid transportation problem. Thereby, we demonstrate a theorem which gives a comfortable condition for the existence of paradox in this type of problem. Next we present an algorithm to find out all the paradoxical pairs as well as paradoxical range of flow and paradoxical pair for a specified flow if paradox exists. Also we illustrate a numerical example in support of the given algorithm.