中文摘要：

讨论了一类由一阶连续可微函数构成的无约束min-max-min问题．通过构造目标函数的区间扩张、无解区域删除原则，建立了求解min-max-min问题的区间算法，证明了算法的收敛性，给出了数值算例．理论证明和数值结果表明方法是可靠和有效的．

英文摘要：

In this paper, we describe some interval algorithms for a class of unconstrained Min- Max-Min problems, in which the objective functions are in Ci. By setting up an interval extension of objective function and the region deletion test rules, an interval algorithm was established. The convergence of algorithm was proven. Numerical results are presented and show that the algorithms are efficient.