TY - JOUR
T1 - Linear fractional programming based on triangular neutrosophic numbers
AU - Abdel-Basset, Mohamed
AU - Mohamed, Mai
AU - Smarandache, Florentin
N1 - Publisher Copyright:
Copyright © 2019 Inderscience Enterprises Ltd.
PY - 2019/1
Y1 - 2019/1
N2 - In this paper, a solution procedure is proposed to solve neutrosophic linear fractional programming problem (NLFP) where cost of the objective function, the resources and the technological coefficients are triangular neutrosophic numbers. Here, the NLFP problem is transformed into an equivalent crisp multi-objective linear fractional programming (MOLFP) problem. By using proposed approach, the transformed MOLFP problem is reduced to a single objective linear programming (LP) problem which can be solved easily by suitable linear programming technique. The proposed procedure illustrated through a numerical example.
AB - In this paper, a solution procedure is proposed to solve neutrosophic linear fractional programming problem (NLFP) where cost of the objective function, the resources and the technological coefficients are triangular neutrosophic numbers. Here, the NLFP problem is transformed into an equivalent crisp multi-objective linear fractional programming (MOLFP) problem. By using proposed approach, the transformed MOLFP problem is reduced to a single objective linear programming (LP) problem which can be solved easily by suitable linear programming technique. The proposed procedure illustrated through a numerical example.
KW - LFP
KW - Linear fractional programming
KW - Neutrosophic set
KW - Triangular neutrosophic numbers
UR - http://www.scopus.com/inward/record.url?scp=85058389345&partnerID=8YFLogxK
U2 - 10.1504/IJAMS.2019.096652
DO - 10.1504/IJAMS.2019.096652
M3 - Article
AN - SCOPUS:85058389345
SN - 1755-8913
VL - 11
SP - 1
EP - 20
JO - International Journal of Applied Management Science
JF - International Journal of Applied Management Science
IS - 1
ER -