摘要
讨论了把一类可分离非线性混合整规划问题转化为解一系列非线性规划 ,整数规划 ,再构造填充函数求解的方法 。
This paper considers a class of discrete nonlinear mixed-integer programming problems,we turn it into a series of nonlinear programming and integer programming.Then a class of filled functions are constructed.Using these functions,an algorithm named the filled functions method is given for finding local minimal solution of integer programming problem.
出处
《娄底师专学报》
2001年第2期82-84,共3页
Journal of Loudi Teachers College
关键词
填充函数
非线性混合整规划
非线性规划
整数规划
局部极小解
filled function
nonlinear mixed-integer programming
nonlinear programming
integer programming
local minimal solution
