---

In this paper we consider a global optimization approach for solving fuzzy fractional posynomial geometric programming problems. The problem of concern involves positive trapezoidal fuzzy numbers in the objective function. For obtaining an optimal solution, Dinkelbach’s algorithm which achieves the optimal solution of the optimization problem by means of solving a sequence of subproblems is extended to the proposed problem. In addition, An illustrative example is included to demonstrate the correctness of the proposed solution algorithm.

---

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 Fractional Programming problem to an optimization problem with an interval-valued objective function, so that its boundaries are fractional functions. A numerical example was presented to demonstrate the effectiveness of the proposed method.