Solving Fractional Multicriteria Optimization Problems with Sum of Squares Convex Polynomial Data |
| |
Authors: | Jae Hyoung Lee Liguo Jiao |
| |
Institution: | 1.Department of Applied Mathematics,Pukyong National University,Busan,Republic of Korea;2.Department of Mathematics, College of Science,Yanbian University,Yanji City,China |
| |
Abstract: | This paper focuses on the study of finding efficient solutions in fractional multicriteria optimization problems with sum of squares convex polynomial data. We first relax the fractional multicriteria optimization problems to fractional scalar ones. Then, using the parametric approach, we transform the fractional scalar problems into non-fractional problems. Consequently, we prove that, under a suitable regularity condition, the optimal solution of each non-fractional scalar problem can be found by solving its associated single semidefinite programming problem. Finally, we show that finding efficient solutions in the fractional multicriteria optimization problems is tractable by employing the epsilon constraint method. In particular, if the denominators of each component of the objective functions are same, then we observe that efficient solutions in such a problem can be effectively found by using the hybrid method. Some numerical examples are given to illustrate our results. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|