摘要
针对一类非线性整数规划问题,提出了一个基于切平面的分支定界算法.在这个方法里,用切平面方程将非线性可行域线性化,同时在子问题上确定可行方向,生成切平面,切掉没有整数解的可行域,缩小了可行域,可以减少分支的次数,并进行了收敛性分析和证明.
For a class of nonlinear integer programming problems,a cutting plane branch-and-bound method is proposed.In this method,the nonlinear feasible region were linearizet by the cutting plane equation.At the same time,the feasible direction of the subproblems was determined and the cutting plane was generated,which can cut off feasible region of no integer solutions and narrow the feasible region.This method can reduce the number of branches.
出处
《兰州文理学院学报（自然科学版）》
2014年第2期1-6,共6页
Journal of Lanzhou University of Arts and Science(Natural Sciences)
基金
国家自然科学基金项目资助(11161001)
关键词
非线性整数规划问题
切平面
分支定界算法
可行方向
nonlinear integer programming problem
the cutting plane
branch and bound algorithm
feasible direction
