Abstract: A discrete filled function is presented in this paper to solve discrete global optimization problems over “strictly pathwise connected domains”.It is proved that the proposed function is a discrete filled function.The discrete global optimization problems can be solved by using discrete filled function method.

Key words: discrete global optimization, discrete filled function, inter programming

摘要： 提出了一个离散填充函数，用于求解“严格路径连通域”上的离散全局优化问题。证明了所提出的函数是一个离散填充函数，用相应的离散填充函数算法可以求解离散全局优化问题。

关键词: 离散全局优化, 离散填充函数, 整数规划