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...

In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...

In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are 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...

In this paper, we considered a Stochastic Interval-Valued Linear Fractional Programming problem(SIVLFP). In this problem, the coefficients and scalars in the objective function are fractional-interval, and technological coefficients and the quantities on the right side of the constraints were random variables with the specific distribution. Here we changed a Stochastic Interval-Valued Fractiona...

multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the...