Showing papers by "Xuzhou Institute of Technology published in 2004"

Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems

Abstract: 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 and some region deletion test rules, a new interval algorithm is presented. The relevant 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 numerical results show that the method is reliable and efficient.