A new method for solving quadratic fractional programming problem in neutrosophic environment

Hamiden Abd El-Wahed Khalifa,Majed Alharbi,Pavan Kumar

doi:10.1515/eng-2021-0088

Hamiden Abd El-Wahed Khalifa, Majed Alharbi + Show 1 more

Open Access

https://doi.org/10.1515/eng-2021-0088

Copy DOI

Journal: Open Engineering	Publication Date: Sep 13, 2021
Citations: 7	License type: CC BY 4.0

Affiliation: Qassim University, Barkatullah University

Abstract

Abstract In the current study, a neutrosophic quadratic fractional programming (NQFP) problem is investigated using a new method. The NQFP problem is converted into the corresponding quadratic fractional programming (QFP) problem. The QFP is formulated by using the score function and hence it is converted to the linear programming problem (LPP) using the Taylor series, which can be solved by LPP techniques or software (e.g., Lingo). Finally, an example is given for illustration.

Highlights

Fractional programming (FP) plays important roles in many applications such as economics, non-economic, and indirect applications
Saha et al [14] developed a new method by converting the LFP into a single linear programming problem (LPP) for some cases of the nominator and denominator functions
Gupta et al [28] introduced a model of multiple objective quadratic fractional programming (QFP) model with a set of quadratic constraints and a methodology based on the iterative parametric functions to obtain a set of solutions of the problem

Summary

Introduction

Fractional programming (FP) plays important roles in many applications such as economics, non-economic, and indirect applications. Quadratic fractional programming (QFP) problems have enormous applications in operations research literature. It can be classified on the basis of the homogeneity of the constraints and the factorability of the objective function (Sharma and Singh [21]). Gupta et al [28] introduced a model of multiple objective QFP model with a set of quadratic constraints and a methodology based on the iterative parametric functions to obtain a set of solutions of the problem. Some applications of neutrosophic sets were discussed in various fields of operations research, for instance, assignment problem (Khalifa and Kumar [30]) and complex programming (Khalifa et al [31]).

Preliminaries

Problem formulation and solution concept

Proposed method

Discussion of the results