An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional Programming Problem
This paper develops a general form of neutrosophic linear fractional programming (NLFP) problem and proposed a novel model to solve it. In this method the NLFP problem is decomposed into two neutrosophic linear programming (NLP) problem. Furthermore, the problem has been solved by combination of dua...
Main Authors: | Sapan Kumar Das, S.A. Edalatpanah, Jatindra Kumar Dash |
---|---|
Format: | Article |
Language: | English |
Published: |
University of New Mexico
2020-09-01
|
Series: | Neutrosophic Sets and Systems |
Subjects: | |
Online Access: | https://fs.unm.edu/NSS/AnIntelligentDualSimplex5.pdf |
Similar Items
-
A novel lexicographical-based method for trapezoidal neutrosophic linear programming problem
by: Sapan Kumar Das, et al.
Published: (2021-10-01) -
A Modified Novel Method for Solving the Uncertainty Linear Programming Problems Based on Triangular Neutrosophic Number
by: Kshitish Mohanta, et al.
Published: (2022-05-01) -
Modified solution for neutrosophic linear programming problems with mixed constraints
by: S. K. Das, et al.
Published: (2020-03-01) -
Solving Neutrosophic Linear Programming Problems Using Exterior Point Simplex Algorithm
by: M Elsayed Badr, et al.
Published: (2021-08-01) -
Generalised single valued neutrosophic number and its application to neutrosophic linear programming
by: Tuhin Bera, et al.
Published: (2019-04-01)