Neutrosophic Mathematical Formulas of Transportation Problems

被引:0
|
作者
Jdid M. [1 ]
Khalid H.E. [2 ]
机构
[1] Faculty of Informatics Engineering, Al-Sham Private University, Damascus
[2] Telafer University, The Administration Assistant for the President of the Telafer University, Telafer
关键词
Linear programming; Neutrosophic consumption quantities; Neutrosophic production quantities; Neutrosophic transportation problem (ntp);
D O I
10.5281/zenodo.7135445
中图分类号
学科分类号
摘要
This paper comes side by side with the complement paper (Original Methods for Obtaining the Initial Solution in Neutrosophic Transportation Problems), these two papers regarded as twins, they are both dedicated to sounding the transportation problems from the perspective of neutrosophic theory, having kinds of indeterminacy in three aspects are: 1-The entries of the payment matrix are neutrosophic values (i.e. Ncij = [cij ± ε] ); the indexes i&j have their usual meaning representing the transportation cost of one unit from the production center i to the consumption center j. Assume the indeterminate ε = [λ1, λ2]. 2-The available and the required quantities are both having neutrosophic values represented by Nai = ai ± εi, Nbj = bj ± δj respectively, where εi = [λi1, λi2], δj = [μj1, μj2]. 3-This kind of neutrosophic transportation problem is represented gathered from the above two cases © 2022, Neutrosophic Sets and Systems.All Rights Reserved.
引用
收藏
页码:930 / 938
页数:8
相关论文
共 50 条