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 条
  • [1] A novel artificial variable-free simplex algorithm for solving neutrosophic linear programming problems
    El Seedy, Essam
    Elrayes, Amani
    Badr, Elsayed
    Rabie, Aya
    ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2021, (46): : 941 - 958
  • [2] Dual Artificial Variable-Free Simplex Algorithm for Solving Neutrosophic Linear Programming Problems
    Rabie, Aya
    el Seidy, Essam
    Elrayes, Amani
    Badr, Elsayed
    Neutrosophic Sets and Systems, 2021, 46 : 36 - 49
  • [3] On using exterior penalty approaches for solving linear programming problems
    Sherali, HD
    Özdaryal, B
    Adams, WP
    Attia, N
    COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (11) : 1049 - 1074
  • [4] Solving Non-linear Neutrosophic Linear Programming Problems
    Lachhwani K.
    Neutrosophic Sets and Systems, 2023, 60 : 6 - 20
  • [5] AN INFEASIBLE (EXTERIOR POINT) SIMPLEX ALGORITHM FOR ASSIGNMENT PROBLEMS
    PAPARRIZOS, K
    MATHEMATICAL PROGRAMMING, 1991, 51 (01) : 45 - 54
  • [6] Infeasible (exterior point) simplex algorithm for assignment problems
    Paparrizos, Konstantinos
    Mathematical Programming, Series B, 1991, 51 (01): : 45 - 54
  • [7] A DECISION RULE FOR IMPROVED EFFICIENCY IN SOLVING LINEAR PROGRAMMING PROBLEMS WITH THE SIMPLEX ALGORITHM
    DICKSON, JC
    FREDERICK, FP
    COMMUNICATIONS OF THE ACM, 1960, 3 (09) : 509 - 512
  • [8] A novel method for solving the fully neutrosophic linear programming problems
    Abdel-Basset, Mohamed
    Gunasekaran, M.
    Mohamed, Mai
    Smarandache, Florentin
    NEURAL COMPUTING & APPLICATIONS, 2019, 31 (05): : 1595 - 1605
  • [9] A New Method for Solving Interval Neutrosophic Linear Programming Problems
    Nafei, Amirhossein
    Yuan, Wenjun
    Nasseri, Hadi
    GAZI UNIVERSITY JOURNAL OF SCIENCE, 2020, 33 (04): : 796 - 808
  • [10] An exterior-point method for linear programming problems
    Andrus, JF
    Schaferkotter, MR
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1996, 91 (03) : 561 - 583
12345