In this paper, the researchers present a multi-objective linear fractional inventory model using fuzzy pro-gramming. The proposed method in this paper is applied to a problem with two objective functions. The re-sulted fuzzy model is transformed into an ordinary linear programming. The implementation of the develop-ing model presented in this paper is demonstrated through the use of some numeri...

The sum of a fractional program is a nonconvex optimization problem in the field of fractional programming and it is difficult to solve. The development of research is restricted to single objective sums of fractional problems only. The branch and bound methods/algorithms are developed in the literature for this problem as a single objective problem. The theoretical and algorithmic development ...

This paper deals with priority based fuzzy goal programming approach for solving multi-objective linear fractional programming problem. In the model formulation of the problem, we construct the fractional membership functions by determining the optimal solution of the objective functions subject to the system constraints. The fractional membership functions are then transformed into equivalent ...

data envelopment analysis operates as a tool for appraising the relative efficiency of a set of homogenous decision making units. this methodology is applied widely in different contexts. regarding to its logic, dea allows each dmu to take its optimal weight in comparison with other dmus while a similar condition is considered for other units. this feature is a bilabial characteristic which opt...

We derive conditions on the functions ', , v and w such that the 0–1 fractional programming problem max x2f0I1gn 'ıv.x/ ıw.x/ can be solved in polynomial time by enumerating the breakpoints of the piecewise linear functionˆ. / D max x2f0I1gn v.x/ w.x/ on Œ0IC1/. In particular we show that when ' is convex and increasing, is concave, increasing and strictly positive, v and w are supermodular and...

This paper investigated solving Fractional Programming Problems under Uncertainty (FPPU) using Sperm Motility Algorithm. Sperm Motility Algorithm (SMA) is a novel metaheuristic algorithm inspired by fertilization process in human, was proposed for solving optimization problems by Osama and Hezam [1]. The uncertainty in the Fractional Programming Problem (FPP) could be found in the objective fun...

In this paper, the parametrically generalized sufficient efficiency conditions for multiobjective fractional programming based on the hybrid (Φ, ρ, η, ζ, θ)−invexities are developed, and then efficient solutions to the multiobjective fractional programming problems are established. Furthermore, the obtained results on sufficient efficiency conditions are generalized to the case of the ε−efficie...