摘要
法使之适于直接求解整数规划问题．首先，给出整数规划问题的离散局部极小解的定义，并设计找离散局部极小解的邻域搜索算法．其次，构造整数规划问题的填充函数算法．该方法通过寻找填充函数的离散局部极小解以期找到整数规划问题的比当前离散局部极小解好的解．本文的算法是直接法，数值试验表明算法是有效的．
This paper modifies the filled function method[1], which is previously designed to solve continuous global optimization problems, to solve integer programming problems. With the definition of discrete local minimal solution of an integer programming problem, this paper presents a neighbourhood search algorithm for finding a discrete local minimal solution of the problem. Then a filled function method for the integer programming problem is proposed, which tries to find a better discrete local minimal solution of the problem by minimizing a filled function. Numerical results are presented to show the effectiveness of the method.
出处
《应用数学学报》
CSCD
北大核心
2000年第4期481-487,共7页
Acta Mathematicae Applicatae Sinica
基金
国家973项目!(G1998030600)
福建省自然科学基金!(A0010010)
福建省教委科技开发基金!(JA00143
