LAUSR

This article establishes a branch–bound technique to solve nonlinear convex–convex fractional multi-objective optimization problem in the non-convex feasible region. As far as the authors are concerned, this kind of problem is not solved by any other author in the literature. By transformation, multi-objective non-linear fractional problem is transformed into a multi-objective non-linear optimization problem. After giving preferences of weight to each objective, the original NLFMOOP is transformed into a nonlinear single-objective programming problem. Lagrange’s theorem of weak duality is used to find lower and upper bound for single objective nonlinear optimization problems in the feasible region. Some theoretical results for solving the multi-objective non-linear fractional problem have also been established. For showing the application of the proposed method, it has been applied to two numerical problems.