一类带约束多目标优化问题的区间算法  

Interval algorithm of constrained multiobjective optimization problems

作　　者：刘梁[1] 曹德欣[1] 邢庆峰[1] 

机构地区：[1]中国矿业大学理学院,江苏徐州221008

出　　处：《黑龙江科技学院学报》2009年第1期76-78,82,共4页Journal of Heilongjiang Institute of Science and Technology

基　　金：国家自然科学基金项目(60775044);中国矿业大学科技基金项目(A200410)

摘　　要：重点研究了带约束多目标优化问题的区间算法,其中目标函数和约束条件均为Lips-chitz连续函数。结合评价函数法将带约束的多目标优化问题转化为无约束优化问题,并给出相应的区间扩张,对相关定理进行了证明。利用二分原则和区域删除检验原则,构造了求解多目标优化问题的区间算法,并给出具体算例。结果表明,所建立的算法是可靠有效的。This paper is focused on constrained muhiobjective optimization problems that objective functions and constrained functions are Lipsehitz eontinous. The paper, combined with evaluation function introduces the transformation of constrained problems into unconstrained ones, and offers an interval extension. The correlative theorem was proved. An interval algorithm was established by the region bisection method and region deletion testing rules. The numerical results presented show that the algorithm works reliably and efficiently.

关 键 词：多目标优化问题 区间算法 LIPSCHITZ连续 评价函数 

分 类 号：O242.29[理学—计算数学]