求解非线性整数规划全局最优解的填充函数法  

A Filled Function Method for Finding a Global Solution of Nonlinear Integer Programming

作　　者：贺向阳[1] 徐玲[1] 

机构地区：[1]上海第二工业大学理学院,上海201209

出　　处：《科学技术与工程》2010年第35期8666-8669,共4页Science Technology and Engineering

摘　　要：提出了一个填充函数,用来求解"严格路径连通域"上的非线性整数规划全局最优解问题。探讨了该填充函数的理论性质,提出了相应的求解算法,并进行了算例测试。测试结果表明该算法令人鼓舞。A filled function for finding a global solution of nonlinear integer programming over strictly pathwise connected domains is proposed.The theoretical properties of the proposed filled function are investigated and a corresponding filled function algorithm is developed.A numerical test of is also made.The computational results show that the proposed method is promising

关 键 词：非线性整数规划 严格路径连通域 填充函数 填充函数法 全局极小点 

分 类 号：O241.7[理学—计算数学]