On robust weakly $\epsilon$-efficient solutions for multi-objective fractional programming problems under data uncertainty

In this study, we use the robust optimization techniques to consider a class of multi-objective fractional programming problems in the presence of uncertain data in both of the objective function and the constraint functions. The components of the objective function vector are reported as ratios involving a convex non-negative function and a concave positive function. In addition, on applying a parametric approach, we establish $\epsilon$-optimality conditions for robust weakly $\epsilon$-efficient solution. Furthermore, we present some theorems to obtain a robust $\epsilon$-saddle point for uncertain multi-objective fractional problem.