In this paper a multi - objective linear fractional programming problem with the fuzzy variables and vector of fuzzy resources is studied and an algorithm based on a parametric approach is proposed. The proposed solving procedure is based on the parametric approach to find the solution, which provides the decision maker with more complete information in line with reality. The simplicity of the ...

in this paper, the portfolio selection problem is considered, where fuzziness and randomness appear simultaneously in optimization process. since return and dividend play an important role in such problems, a new model is developed in a mixed environment by incorporating fuzzy random variable as multi-objective nonlinear model. then a novel interactive approach is proposed to determine the pref...

In this article, a fuzzy goal programming (GP) and method of approximation is presented for the solution of a multiobjective linear plus linear fractional programming problem. In the proposed approach, membership functions are defined for each fuzzy goal and then a method of variable change on the underand overdeviational variables of the membership functions associated with the fuzzy goals of ...

This paper presents a linear fractional programming approach for solving multi objective linear programming problem. We develop a model to solve multi objective linear programming problem into fractional programming problem and proposed a method for linearization of a fractional objective. In particular, we consider the optimization of ratio of profit and cash expenditure as fractional objectiv...

[naeini1] in this paper, a new method is proposed to find the fuzzy optimal solution of fuzzy multi-objective linear programming problems (fmolpp) with fuzzy right hand side and fuzzy decision variables. due to the imprecise nature of available resources, determination of a definitive solution to the model seems impossible. therefore, the proposed model is designed in order to make fuzzy decisi...

Let a polyhedral convex set be given by a finite number of linear inequalities and consider the problem to project this set onto a subspace. This problem, called polyhedral projection problem, is shown to be equivalent to multiple objective linear programming. The number of objectives of the multiple objective linear program is by one higher than the dimension of the projected polyhedron. The r...