摘 要:
本文给出了一类新的求解箱约束全局整数规划问题的填充函数,并讨论了其填充性质.基于提出的填充函数,设计了一个求解带等式约束、不等式约束、及箱约束的全局整数规划问题的算法.初步的数值试验结果表明提出的算法是可行的。[著者文摘]
文章出处:
《应用数学》-2007年20卷2期 -316-321页
Mathematica Applicata
分 类 号:
文献标识码:
A
文章编号:
1001-9847(2007)02-0316-06
[参考文献]
A Filled Function Method for Constrained Global Integer Optimization
HUANG Zheng-hai ,XU Shang-wen (Department of Mathematics,School of Science, Tianjin University , Tianjin 300072 ,China)
Abstract:
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.[著者文摘]
Key words:
Global optimization ; Integer programming ; Filled function Global minimizer
收稿日期: 2006-08-28
基金资助:
国家自然科学基金资助项目(10571134)

更多评论>>文章评论
学术















cqvip.com