﻿ 求解一类凸多目标规划最小弱有效解的填充函数法

# 求解一类凸多目标规划最小弱有效解的填充函数法A Filled Function Method of Finding Weak Efficient Mi-nimizer for Convex Multi-Objective Optimization

Abstract: To a kind of multi-objective optimization problem, which objective function is convex vector function and which constraints are box sets, firstly we use linear weighted method to turn it into nonconvex single-objective optimization problem, secondly we get the global minimizer of the single-objective optimi-zation problem by implying the filled function method, then we attain the weak efficient minimizer of the prime multi-objective optimization problem.

 D. S. Liu, K. C. Tan, and S. Y. Huang. On solving multiobjective bin packing problems using evolutionary particle swarm optimization. European Journal of Operational Research, 2008, 190(2): 357-382.

 仇秋生, 集值优化问题全局极小解集的连通性[J]. 浙江师范大学学报(自然科学版), 2009, 32(3): 257-261.

 I. A. Baky. Solving multi-level multi-objective linear programming problems through fuzzy goal programming approach. Applied Mathematical Modelling, 2010, 34(9): 2377-2387.

 林锉云, 董加礼. 多目标优化的方法与理论[M]. 长春: 吉林教育出版社, 1992.

 R. P. Ge. The theory of filled function methods for finding global minimizers of nonlinearly constrained minimization problems. Journal of Computational Mathematics, 1987, 5: 1-9.

 W. X. Zhu. A class of filled functions irrelevant to the number of local minimizers for global optimization. Journal of Systems Science and Mathematical Sciences, 2002, 22(4): 406-413.

 M. Kong. On the filled function method for nonsmooth program. Journal of Systems Science and Mathematical Sciences, 2004, 20(4): 149-154.

 C. J. Wang, Y. J. Yang, and J. Li. A new filled function method for unconstrained global optimization. Applied Mathematics and Computation, 2009, 225(1): 68-79.

 W. X. Wang, Y. L. Shang, and L. S. Zhang. A filled function method with one parameter for box constrained global optimization. Applied Mathematics and Computation, 2007, 194(1): 54- 66.

Top