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

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.

Download Full-text

Ranking Function Application for Optimal Solution of Fractional programming problem

Al-Qadisiyah Journal Of Pure Science ◽

10.29350/jops.2020.25.1.1048 ◽

2020 ◽

Vol 25 (1) ◽

Cited By ~ 2

Author(s):

Rasha Jalal

Keyword(s):

Linear Programming ◽

Programming Problem ◽

Fractional Programming ◽

Linear Programming Problem ◽

Fuzzy Numbers ◽

Optimal Solution ◽

Ranking Function ◽

Linear Fractional Programming ◽

Fractional Programming Problem ◽

Linear Programming Problems

The aim of this paper is to suggest a solution procedure to fractional programming problem based on new ranking function (RF) with triangular fuzzy number (TFN) based on alpha cuts sets of fuzzy numbers. In the present procedure the linear fractional programming (LFP) problems is converted into linear programming problems. We concentrate on linear programming problem problems in which the coefficients of objective function are fuzzy numbers, the right- hand side are fuzzy numbers too, then solving these linear programming problems by using a new ranking function. The obtained linear programming problem can be solved using win QSB program (simplex method) which yields an optimal solution of the linear fractional programming problem. Illustrated examples and comparisons with previous approaches are included to evince the feasibility of the proposed approach.

Download Full-text

A new Mean Deviation and Advanced Mean Deviation Techniques to Solve Multi-Objective Fractional Programming Problem Via Point-Slopes Formula

Pakistan Journal of Statistics and Operation Research ◽

10.18187/pjsor.v17i4.3789 ◽

2021 ◽

pp. 1051-1064

Author(s):

Rebaz Mustafa ◽

Nejmaddin A. Sulaiman

Keyword(s):

Linear Programming ◽

Programming Problem ◽

Fractional Programming ◽

Linear Programming Problem ◽

Optimal Solution ◽

Mean Deviation ◽

New Techniques ◽

Multi Objective ◽

Fractional Programming Problem ◽

A New Technique

In this paper, we have proposed a new technique to find an efficient solution to fractional programming problems (FPP). The multi-objective fractional programming problem (MOFPP) is converted into multi-objective linear programming (MOLPP) utilizing the point-slopes formula for a plane, which has equivalent weights to the MOFPP. The MOLPP is diminished to a single objective linear programming problem (SOLPP) through using two new techniques for the values of the objective function and suggesting an algorithm for its solution. Finally, we obtained the optimal solution for MOFPP by solving the consequent linear programming problem (LPP). The proposed practicability is confirmed with the existing approaches, with some numerical examples and we indicated comparison with other techniques.

Download Full-text