INTERVAL ADJUSTABLE ENTROPY ALGORITHM FOR A CLASS OF UNCONSTRAINED DISCRETE MINIMAX PROBLEMS  

作　　者：LiSubei CaoDexin WangHaijun DengKazhong 

机构地区：[1]XuzhouInstituteofTechnology,Xuzhou221008,China [2]CollegeofSciences,ChinaUnivofMiningandTechnology,Xuzhou221008,China [3]CollegeofEnvironmentandSpatialInformatics,ChinaUniv.ofMiningandTechnology,Xuzhou221008,China

出　　处：《Applied Mathematics(A Journal of Chinese Universities)》2004年第1期37-43,共7页高校应用数学学报（英文版）（B辑）

基　　金：Supported by the National Natural Science Foundation of China(50 1 740 51 )

摘　　要：In this paper,a class of unconstrained discrete minimax problems is described,in which the objective functions are in C 1.The paper deals with this problem by means of taking the place of maximum entropy function with adjustable entropy function.By constructing an interval extension of adjustable entropy function an d some region deletion test rules,a new interval algorithm is presented.The rele vant properties are proven.The minimax value and the localization of the minimax points of the problem can be obtained by this method. This method can overcome the flow problem in the maximum entropy algorithm.Both theoretical and numerica l results show that the method is reliable and efficient.In this paper,a class of unconstrained discrete minimax problems is described,in which the objective functions are in C 1.The paper deals with this problem by means of taking the place of maximum entropy function with adjustable entropy function.By constructing an interval extension of adjustable entropy function an d some region deletion test rules,a new interval algorithm is presented.The rele vant properties are proven.The minimax value and the localization of the minimax points of the problem can be obtained by this method. This method can overcome the flow problem in the maximum entropy algorithm.Both theoretical and numerica l results show that the method is reliable and efficient.

关 键 词：discrete minimax problem adjustable entropy function interval algorithm . 

分 类 号：O224[理学—运筹学与控制论]