Solving Neutrosophic Linear Programming Problems With Two-Phase Approach
Keyword(s):
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.
2021 ◽
Vol 10
(5)
◽
pp. 90-103
2017 ◽
Vol 07
(05)
◽
pp. 285-288
2020 ◽
Vol 25
(1)
◽
2012 ◽
Vol 60
(2)
◽
pp. 163-168
◽
2012 ◽
Vol 532-533
◽
pp. 1626-1630
Keyword(s):
2004 ◽
Vol 21
(01)
◽
pp. 127-139
◽
2015 ◽
Vol 5
(2)
◽
pp. 81-86
◽