‘More (same)-for-less’ paradox in minimal cost network flow problem

‘More (same)-for-less’ paradox in minimal cost network flow problem

0.00 Avg rating0 Votes
Article ID: iaor20012931
Country: Netherlands
Volume: 33
Start Page Number: 167
End Page Number: 177
Publication Date: Jan 1995
Journal: Optimization
Authors: ,
Keywords: more-for-less paradox
Abstract:

In this paper, the conditions that govern the existence of the ‘more(same)-for-less’ paradox in a minimal cost network flow problem with bounded variables are obtained. Some supporting illustrations are also included.

Reviews

Required fields are marked *. Your email address will not be published.