Affiliation:
1. Benha University, Egypt
2. University of New Mexico, USA
Abstract
The neutrosophic primal simplex algorithm starts from a neutrosophic basic feasible solution. If there is no such a solution, we cannot apply the neutrosophic primal simplex method for solving the neutrosophic linear programming problem. In this chapter, the authors propose a neutrosophic two-phase method involving neutrosophic artificial variables to obtain an initial neutrosophic basic feasible solution to a slightly modified set of constraints. Then the neutrosophic primal simplex method is used to eliminate the neutrosophic artificial variables and to solve the original problem.
Reference21 articles.
1. A novel method for solving the fully neutrosophic linear programming problems
2. Intuitionistic fuzzy sets
3. Badr & Moussa. (2019). An upper bound of radio k-coloring problem and its integer linear programming model. Wireless Networks.
4. Some computational results on MPI parallel implementation of dense simplex method;E. S.Badr;World Academy of Science, Engineering and Technology,2008
5. Badr, E. S., Paparrizos, K., Thanasis, B., & Varkas, G. (2006). Some computational results on the efficiency of an exterior point algorithm. Proc. of the 18th National Conference of Hellenic Operational Research Society (HELORS), 1103-1115.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献