学术期刊
切换导航
首 页
文 章
期 刊
投 稿
预 印
会 议
书 籍
新 闻
合 作
我 们
按学科分类
Journals by Subject
按期刊分类
Journals by Title
核心OA期刊
Core OA Journal
数学与物理
Math & Physics
化学与材料
Chemistry & Materials
生命科学
Life Sciences
医药卫生
Medicine & Health
信息通讯
Information & Communication
工程技术
Engineering & Technology
地球与环境
Earth & Environment
经济与管理
Economics & Management
人文社科
Humanities & Social Sciences
合作期刊
Cooperation Journals
首页
数学与物理
理论数学
Vol. 1 No. 2 (July 2011)
期刊菜单
最新文章
历史文章
检索
领域
编委
投稿须知
文章处理费
最新文章
历史文章
检索
领域
编委
投稿须知
文章处理费
求解一类凸多目标规划最小弱有效解的填充函数法
A Filled Function Method of Finding Weak Efficient Mi-nimizer for Convex Multi-Objective Optimization
DOI:
10.12677/pm.2011.12029
,
PDF
,
HTML
,
,
被引量
下载: 3,365
浏览: 12,045
国家自然科学基金支持
作者:
张莹
,
徐应涛
:
关键词:
运筹学
;
多目标规划
;
填充函数
;
局部极小点
;
全局极小点
Operations Research; Multi-Objective Programming; Filled Function; Local Minimizer; Global Minimizer
摘要:
针对一类目标函数为凸向量值函数且约束为箱子集的多目标规划,先利用线性加权和法将其转化为非凸单目标规划,再利用填充函数法求得该单目标规划的全局最优解,从而得到原规划的最小弱有效解。
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.
文章引用:
张莹, 徐应涛. 求解一类凸多目标规划最小弱有效解的填充函数法[J]. 理论数学, 2011, 1(2): 149-155.
http://dx.doi.org/10.12677/pm.2011.12029
参考文献
[
1
]
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.
[
2
]
仇秋生, 集值优化问题全局极小解集的连通性[J]. 浙江师范大学学报(自然科学版), 2009, 32(3): 257-261.
[
3
]
I. A. Baky. Solving multi-level multi-objective linear programming problems through fuzzy goal programming approach. Applied Mathematical Modelling, 2010, 34(9): 2377-2387.
[
4
]
林锉云, 董加礼. 多目标优化的方法与理论[M]. 长春: 吉林教育出版社, 1992.
[
5
]
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.
[
6
]
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.
[
7
]
M. Kong. On the filled function method for nonsmooth program. Journal of Systems Science and Mathematical Sciences, 2004, 20(4): 149-154.
[
8
]
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.
[
9
]
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.
投稿
为你推荐
友情链接
科研出版社
开放图书馆