重庆理工大学学报：自然科学Issue(9)：100-103,4.
非线性整数规划多个解的一种寻找方法
A Way to Find Some Optimal Solutions of Nonlinear Integer Programming
摘要
Abstract
We need to find all optimal solutions （or only one optimal solution） for the integer programming problem. According to the theory of CB cuts, it can use 0-1 linearization method to converse the nonlinear problem into a 0-1 integer programming problem, then exclude a series of optimal solutions with CB cuts to find all the optimal solution of the original problem. At the same time, this paper studies the feasibility of the theory, numerical results also illustrate the effectiveness and feasibility of this approach.关键词
（非）线性整数规划/CB/cuts/最优解/线性化方法Key words
（non） linear integer programming/CB cuts/optimal solution/linearization method分类
数理科学引用本文复制引用
乐鹏,叶晓斌..非线性整数规划多个解的一种寻找方法[J].重庆理工大学学报：自然科学,2011,(9):100-103,4.基金项目
国家自然科学基金资助项目 （）
