Title: Linear fractional programming based on triangular neutrosophic numbers

Authors: Mohamed Abdel-Basset; Mai Mohamed; Florentin Smarandache

Addresses: Department of Operations Research, Faculty of Computers and Informatics, Zagazig University, El-Zera Square, Zagazig, Sharqiyah 44519, Egypt ' Department of Operations Research, Faculty of Computers and Informatics, Zagazig University, El-Zera Square, Zagazig, Sharqiyah 44519, Egypt ' Department of Mathematics, University of New Mexico, 705 Gurley Ave., Gallup, New Mexico 87301, USA

Abstract: 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.

Keywords: linear fractional programming; LFP; neutrosophic set; triangular neutrosophic numbers.

DOI: 10.1504/IJAMS.2019.096652

International Journal of Applied Management Science, 2019 Vol.11 No.1, pp.1 - 20

Received: 23 Mar 2017
Accepted: 08 Jan 2018

Published online: 30 Oct 2018 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article