scholarly journals Nonlinear fractional programming

1975 ◽  
Vol 12 (3) ◽  
pp. 391-397 ◽  
Author(s):  
B. Mond ◽  
B.D. Craven
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Optimal Solution ◽  
Objective Functions ◽  
Fractional Programming Problem ◽  
Special Cases ◽  
Nonlinear Fractional Programming ◽  
Constraint Sets

If an optimal solution exists for a nonlinear fractional programming problem, then this solution is shown to be obtainable by solving two associated programming problems whose objective functions are no longer fractional. A certain restriction is assumed on the constraint sets of the latter problems. This result includes various known theorems as special cases.

scholarly journals A Proposal to the Solution of Multiobjective Linear Fractional Programming Problem

2013 ◽  
Vol 2013 ◽  
pp. 1-4 ◽  
Author(s):  
Nuran Güzel
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Software Package ◽  
Efficient Solution ◽  
Optimal Solution ◽  
Linear Fractional Programming ◽  
Fractional Programming Problem ◽  
Nonlinear Fractional Programming ◽  
Single Objective ◽  
Linear Fractional Programming Problem

We have proposed a new solution to the Multiobjective Linear Fractional Programming Problem (MOLFPP). The proposed solution is based on a theorem that deals with nonlinear fractional programming with single objective function and studied in the work by Dinkelbach, 1967. As a new contribution, we have proposed that is an efficient solution of MOLFPP if is an optimal solution of problem , where is for all . Hence, MOLFPP is simply reduced to linear programming problem (LPP). Some numerical examples are provided in order to illustrate the applications of the proposed method. The optimization software package, namely, WinQSB (Chang, 2001), has been employed in the computations.

scholarly journals Ranking Function Application for Optimal Solution of Fractional programming problem

2020 ◽  
Vol 25 (1) ◽  
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.

scholarly journals Duality for multiobjective fractional programming problems involving d -type-I n-set functions

2009 ◽  
Vol 19 (1) ◽  
pp. 63-73
Author(s):  
I.M. Stancu-Minasian ◽  
Gheorghe Dogaru ◽  
Mădălina Stancu
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Generalized Convexity ◽  
Type I ◽  
Multiobjective Fractional Programming ◽  
Fractional Programming Problem ◽  
Duality Results ◽  
Set Functions ◽  
Convexity Assumptions ◽  
Nonlinear Fractional Programming

We establish duality results under generalized convexity assumptions for a multiobjective nonlinear fractional programming problem involving d -type-I n -set functions. Our results generalize the results obtained by Preda and Stancu-Minasian [24], [25].

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

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. 

Sign in / Sign up

Export Citation Format

Share Document