主要讨论了无约束多目标优化问题Pareto最优解集的求解方法,其中问题的目标函数是C^1连续函数.给出了Pareto最优解集的一个充要条件,定义了α强有效解,并结合区间分析的方法,建立了求解无约束多目标优化问题Pareto最优解集的区间算法,理论分析和数值结果均表明该算法是可靠和有效的.
This paper is concerned with the Pareto solution set of multiohjective optimization problem with unconstrain, in which the objective functions functions are C^1. We define α high-efficient solution, a necessary and sufficient condition of Pareto solution set is given. At last, we design an interval algorithm of sloving Pareto solution set of multiobjective optimization problem with interval analysis method. The theoretic analyses and numerical results indicate that the algorithm is convergence, stable and reliable.