摘要
本文给出了一类新的求解箱约束全局整数规划问题的填充函数,并讨论了其填充性质.基于提出的填充函数,设计了一个求解带等式约束、不等式约束、及箱约束的全局整数规划问题的算法.初步的数值试验结果表明提出的算法是可行的.
A class of new filled functions for box constrained integer programming are presented, and their filled properties are discussed. An algorithm based on the constructed filled functions is proposed for solving the global integer programming problem with equality, inequality and box constrained. Preliminary numerical results show that the proposed algorithm is promising.
出处
《应用数学》
CSCD
北大核心
2007年第2期316-321,共6页
Mathematica Applicata
基金
国家自然科学基金资助项目(10571134)
关键词
全局优化
整数规划
填充函数
全局极小点
Global optimization
Integer programming
Filled function Global minimizer
