Solving Neutrosophic Linear Programming Problems Using Exterior Point Simplex Algorithm

被引：0
|
作者：
Badr, Elsayed [1 ,2 ]
Nada, Shokry [3 ]
Ali, Saeed [3 ]
Elrokh, Ashraf [3 ]
机构：
[1] Scientific Computing Department, Faculty of Computers and Informatics, Benha University, Benha, Egypt
[2] Higher Technological Institute, 10th of Ramadan City, Egypt
[3] Mathematics and Computer Science Department, Faculty of Science Menoufia University, Egypt
来源：
Neutrosophic Sets and Systems | 2021年 / 45卷
关键词：
Fuzzy sets - Linear programming;
D O I：
暂无
中图分类号：
O24 [计算数学];
学科分类号：
070102 ;
摘要：
In this manuscript, three contributions are proposed. First contribution is proposing a good evaluation between the fuzzy and neutrosophic approaches using a novel fuzzy-neutrosophic transfer. Second contribution is introducing a general framework for solving the neutrosphic linear programming problems using the advantages of the method of Abdel-Basset et al. and the advantages of Singh et al.’s method. Third contribution is proposing a new neutrosophic exterior point simplex algorithm NEPSA and its fuzzy version FEPSA. NEPSA has two paths to get optimal solutions. One path consists of basic not feasible solutions but the other path is feasible. Finally, the numerical examples and results analysis show that NEPSA more than accurate FEPSA. © 2021
引用
收藏
页码：320 / 339
相关论文
共 50 条
  • [31] A note on a modified simplex approach for solving bilevel linear programming problems
    Campêlo, M
    Scheimberg, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 126 (02) : 454 - 458
  • [32] A MODIFIED SIMPLEX APPROACH FOR SOLVING BILEVEL LINEAR-PROGRAMMING PROBLEMS
    ONAL, H
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 67 (01) : 126 - 135
  • [33] Using Genetic Algorithm for Solving Linear Multilevel Programming Problems via Fuzzy Goal Programming
    Pal, Bijay Baran
    Chakraborti, Debjani
    Biswas, Papun
    CONTROL, COMPUTATION AND INFORMATION SYSTEMS, 2011, 140 : 79 - +
  • [34] A PARAMETRIC SIMPLEX ALGORITHM FOR BIOBJECTIVE PIECEWISE LINEAR PROGRAMMING PROBLEMS
    Hu, Rong
    Fang, Ya-Ping
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2017, 13 (02) : 573 - 586
  • [35] A simplex algorithm for piecewise-linear fractional programming problems
    Pandey, Pooja
    Punnen, Abraham P.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 178 (02) : 343 - 358
  • [36] A simplex social spider algorithm for solving integer programming and minimax problems
    Tawhid, Mohamed A.
    Ali, Ahmed F.
    MEMETIC COMPUTING, 2016, 8 (03) : 169 - 188
  • [37] A simplex social spider algorithm for solving integer programming and minimax problems
    Mohamed A. Tawhid
    Ahmed F. Ali
    Memetic Computing, 2016, 8 : 169 - 188
  • [38] Computational complexity of the exterior point simplex algorithm
    Sophia Voulgaropoulou
    Nikolaos Samaras
    Angelo Sifaleras
    Operational Research, 2019, 19 : 297 - 316
  • [39] Computational complexity of the exterior point simplex algorithm
    Voulgaropoulou, Sophia
    Samaras, Nikolaos
    Sifaleras, Angelo
    OPERATIONAL RESEARCH, 2019, 19 (02) : 297 - 316
  • [40] Solving the general fully neutrosophic multi-level multiobjective linear programming problems
    Kailash Lachhwani
    OPSEARCH, 2021, 58 : 1192 - 1216
12345