Pseudo paradox in minimum cost network flow problem Online publication date: Tue, 12-Sep-2017
by Sonia; Ankit Khandelwal
International Journal of Operational Research (IJOR), Vol. 30, No. 2, 2017
Abstract: In this paper, an attempt to introduce the concept of pseudo paradox in minimum cost network flow problems is made. The conditions that govern the existence of pseudo paradox are identified and illustrated with the help of numerical examples.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com