由任意初始点求解离散型约束全局优化问题

摘要

The purpose of this article is to present a method of solution for the discrete global optimization problem with constraints. A discrete filled function with the 0-1 variable is proposed. The better minimum can be gotten by the filled function from any initial point so as to find a global minimizer. Also the properties on the filled function are discussed and the results of numerical experiments are listed at the end.%本文研究了带约束离散型非线性全局优化的求解问题.利用0-1变量提出了一个离散填充函数算法.该算法可由任意初始点出发,不断求得更好的局部极小点,以期得到离散全局最小点.文章同时讨论了所构造的填充函数的性质,给出了数值试验结果.