【摘要】 <正> 文[1]、[2]讨论了极大极小目标函数的规划问题,并举例说明了在军事、经济等许多领域中都有着极其重要的应用,但在实际问题中,又常常遇到变量要求取整数值的瓶颈问题,即出现了如下整数瓶颈问题更多还原

【Abstract】 In the paper, we discuss a general integer bottleneck problem:max min cixi, T = {x|(1/n)转换成 sum from i=1 to n(1/n), integers}.x∈TA strictly ascent algorithm for this problem is given and it is very effective for the problem with different constrained right-hand b.更多还原