摘要
求解整数非线性规划问题的局部极小点是求解整数非线性规划问题的全局最优解的前提.很多求解整数非线性规划问题全局最优解辅助函数法(比如填充函数法)都需要先求整数非线性规划问题的局部极小点.给出求解非线性整数规划问题局部极小点的坐标轮换法,并与已有的两种方法作了算例比较.
It is the precondition to obtain local minimizers in integer nonlinear programming.A lot of auxiliary function methods,such as the filled function method,about solving the global optimization problem need firstly to obtain a local minimizer.New algorithms for obtaining the local minimizers of integer nonlinear programming problems are proposed in this paper.Then some examples are considered and the differences of those algorithms are analysed.
出处
《湖北民族学院学报（自然科学版）》
CAS
2009年第4期394-397,共4页
Journal of Hubei Minzu University(Natural Science Edition)
基金
新世纪优秀人才支持计划项目(NCET-06-0776)
关键词
整数非线性规划
局部极小点
局部极小值
算法
integer nonlinear programming
local minimum point
local minimum
algorithm
