Paradox in The d-Dimensional Fixed Charge Transportation Problem and Algorithm for Finding The Paradox-Reference-Cited by-同舟云学术

Paradox in The d-Dimensional Fixed Charge Transportation Problem and Algorithm for Finding The Paradox

Published:2022-06-01 Issue: Volume: Page:329-336
ISSN:2220-5810
Container-title:Pakistan Journal of Statistics and Operation Research
language:
Short-container-title:Pak.j.stat.oper.res.

Author:

Silalahi Bib Paruhum^ORCID,Sulistyono Eko,Bukhari Fahren

Abstract

The d-dimensional fixed charge transportation problem is a generalization of fixed charge transportation. This problem has d-type of constraints so that can be applied to more complex problem. In transportation problem, sometimes there is a cases when increase the product in shipping, the number of costs incurred is less than before the increase of product. This problem is called the transportation paradox. In this research, it will be explained about the model of d-dimensional fixed charge transportation problem and sufficient condition for the occurrence of the paradox. Furthermore an algorithm is given in finding the paradox in the d-dimensional fixed charge transportation problem with example to support the theory presented.

Publisher

Pakistan Journal of Statistics and Operation Research

Subject

Management Science and Operations Research,Statistics, Probability and Uncertainty,Modeling and Simulation,Statistics and Probability

Reference18 articles.

1. Acharya, D. P., Basu, M., and Das, A. (2015). The algorithm of ﬁnding all paradoxical pairs in a ﬁxed charge transportation problem. Journal of Computer and Mathematical Sciences, 6:344–352.

2. Arora, S. R. and Ahuja, A. (2000). Paradox in a ﬁxed charge transportation problem. Indian Journal Pure Applied Mathematics, 31:809–822.

3. Chvatal, V. (1983). Linear Programming. W.H. Freeman and Company, New York.

4. Das, A., Acharya, D. P., and Basu, M. (2015). More-for-less paradox in a solid transportation problem. Journal of Information and Computing Science, 10:271–276.

5. Eiselt, H. and Sandblom, C. (2018). Linear Programming and Its Applications. Springer, New York.