TY - JOUR
T1 - More-For-Less Paradox in a Solid Transportation Problem
AU - AtanuDas, Debi Prasad Acharya and ManjusriBasu
JO - Journal of Information and Computing Science
VL - 4
SP - 271
EP - 276
PY - 2024
DA - 2024/01
SN - 10
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22535.html
KW - Solid Transportation Problem, Paradox in a Solid Transportation Problem, Paradoxical Range 
of Flow 

AB - 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.