一类带约束min-max-min问题的区间算法  

An Interval Algorithm for a Class of Constrained min-max-min Problems

作　　者：储丹华[1] 曹德欣[1] 陈月霞[1] 

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

出　　处：《石河子大学学报（自然科学版）》2007年第2期256-259,共4页Journal of Shihezi University(Natural Science)

基　　金：国家自然科学基金项目(60575046)

摘　　要：建立了一类带约束Min-Max-Min问题的数值方法,其中目标函数和约束条件均为Lipschitz连续函数。利用区间分析方法,基于罚函数法和区域二分原则,针对问题及目标函数约束条件的不可微的特点,构造了罚函数的区间扩张和无解区域删除原则,建立了区间算法,证明了该算法的收敛性。对算法进行了数值实验,并给出了数值算例,结果表明:该方法可以同时求出问题的最优值和全部全局最优解,是有效和可靠的。An interval method for a class of constrained min-max-min problems is established, in which the objective functions and constrained functions are Lipsehitz continuous. Using the interval analysis and based on the penalty function and the region bisection method, and eontmposing the nondifferentiable trait of the problem and the constrained condition of the objective functions,the interval extensions of penalty functions and region deletion testing rules were constructed, the interval algorithm was established and convergence of algorithm was proven. Numerical experiments are performed to the algorithm and numerical results are presented. The results show that the method gets both the best value and all global solutions. The algorithm is effective and reliable.

关 键 词：Min-Max-Min问题 区间算法 罚函数法 全局解 

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