一类无约束二层规划问题的区间算法  

An interval algorithm for a class of unconstrained two-level programming problems

作　　者：秦军[1] 曹德欣[1] 

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

出　　处：《山东大学学报（理学版）》2012年第3期120-126,共7页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(70901073);中央高校基本科研业务费专项基金项目(JGK101676)

摘　　要：讨论了目标函数为一阶连续可微函数的无约束二层规划问题的区间算法,构造了二层规划问题目标函数的区间扩张和无解区域删除检验原则,建立了求解无约束二层规划问题的区间算法,并进行了数值实验。理论证明和数值实验均表明算法是可靠和有效的。The interval algorithm for a class of unconstrained two-level programming problems is discussed, in which the objective functions are in C1. By way of constructing the interval extensions of the two-level objective functions and introducing the test rules of region deletion, an interval algorithm for solving unconstrained two-level programming problems is established, and experimentation upon the numerical examples is performed. Both theoretical proof and nu- merical experiments show that the algorithm is reliable and effective.

关 键 词：二层规划 区间算法 区间扩张 

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