Main Article Content


The d-dimensional fixed charge transportation problem is a generalization of fixed charge transportation. This problem has d-type of constraints so that it can be applied to more complex problem. In the transportation problem, sometimes there are some cases when increasing the product in shipping, the number of costs incurred is less than before increasing the 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 an example to support the theory presented.


d-Dimensional Fixed Charge Linear Programming Transportation Paradox Transportation Problem

Article Details

How to Cite
Silalahi, B. P., Sulistyono, E., & Bukhari, F. (2022). Paradox in The d-Dimensional Fixed Charge Transportation Problem and Algorithm for Finding The Paradox. Pakistan Journal of Statistics and Operation Research, 18(2), 329-336.


  1. Acharya, D. P., Basu, M., and Das, A. (2015). The algorithm of finding all paradoxical pairs in a fixed charge transportation problem. Journal of Computer and Mathematical Sciences, 6:344–352.
  2. Arora, S. R. and Ahuja, A. (2000). Paradox in a fixed 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.
  6. George, A. O., Jude, O., Anderson, C. N., Vitus, O., and Andrew, I. I. (2014). Paradox algorithm in application of a linear transportation problem. American Journal of Applied Mathematics and Statistics, 2:10–15. DOI:
  7. Joshi, V. D. and Gupta, N. (2012). Identifying more-for-less paradox in the linear fractional transportation problem using objective matrix. Matematika, 28:173–180.
  8. Kautsar, M. M. A., Silalahi, B. P., and Guritman, S. (2018). Paradox in a d-dimensional transportation problem. International Journal of Pure and Applied Mathematics, 118(3):547–557.
  9. Kumar, A., Gupta, A., and Sharma, M. K. (2010). Solving fuzzy bi-criteria fixed charge transportation problem using a new fuzzy algorithm. International Journal of Applied Science and Engineering, 8:77–98.
  10. Mayyani, H., Silalahi, B. P., and Aman, A. (2017). Frequency determination of bus rapid transit (BRT) applied on service system of trans mataram metro bus to minimize the operational cost. International Journal of Engineering and Management Research (IJEMR), 7(6):134–140.
  11. Robers, P. and Cooper, L. (1976). A study of the fixed charge transportation problem. Computers and Mathematics with Applications, 2:125–135. DOI:
  12. Saifudin, M. A., Silalahi, B. P., and Sitanggang, I. S. (2015). Star catalog generation for satellite attitude navigation using density based clustering. Journal of Computer Science, 11(12):1082–1089. DOI:
  13. Schrenk, S., Finke, G., and Cung, V. D. (2011). Two classical transportation problems revisited: Pure constant fixed charges and the paradox. Mathematical and Computer Modelling, 54:2306–2315. DOI:
  14. Silalahi, B. P. (2014). Sharper analysis of upper bound for the iteration complexity of an interior-point method using primal-dual full-Newton step algorithm. Far East Journal of Mathematical Sciences, 95(1):69–80.
  15. Silalahi, B. P. and Dewi, M. S. (2014). Comparison of sensitivity analysis on linear optimization using optimal partition and optimal basis (in the simplex method) at some cases. In IndoMS International Conference on Mathematics and Its Applications, pages 82–90. Indonesian Mathematical Society.
  16. Silalahi, B. P., Laila, R., and Sitanggang, I. S. (2017). A combination method for solving nonlinear equations. In IOP Conference Series: Materials Science and Engineering, volume 166, page 012011. IOP Publishing. DOI:
  17. Vanderbei, R. J. (2014). Linear Programming: Foundations and Extensions. Springer, New York. DOI:
  18. Wihartiko, F. D., Buono, A., and Silalahi, B. P. (2017). Integer programming model for optimizing bus timetable using genetic algorithm. In IOP Conference Series: Materials Science and Engineering, volume 166, page 012016. IOP Publishing. DOI: