In this paper, we are interested in solving a linear fractional program by two different approaches. The first one is based on interior point methods which makes it possible to solve an equivalent the program. second allows us variational inequalities problem efficient projection method. Numerical tests were carried out approaches and comparative study was out. numerical show clearly that more ...

Like a linear programming (LP) problem, linear-fractional programming (LFP) problem can be usefully applied in a wide range of real-world applications. In the last few decades a lot of research papers and monographs were published throughout the world where authors (mainly mathematicians) investigated different theoretical and algorithmic aspects of LFP problems in various forms. In this paper ...

In this paper, we establish a proof for  a  necessary condition for  multiple objective fractional programming. In order to derive the set of necessary conditions, we employ an equivalent parametric problem. Also, we  present the related semi parametric model.

This paper proposes a fuzzy goal programming based on Taylor series for solving decentralized bilevel multiobjective fractional programming (DBLMOFP) problem. In the proposed approach, all of the membership functions are associated with the fuzzy goals of each objective at the both levels and also the fractional membership functions are converted to linear functions using the Taylor series appr...

recently, lotfi et al. [10] established an equivalence model between the output-oriented dual ccr model and multiple objective linear programming (molp) and used an interactive method for finding target unit on efficiency frontier such that the decision maker preferences can be taken into account. however their method is not applicable for situations in which some outputs are undesirable and ne...

in this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. we study this problem and capture some special characteristics of its feasible domain and optimal s...