| 凹整数规划的分枝定界解法 |
| |
| 引用本文： | 钟培华,孙小玲.凹整数规划的分枝定界解法[J].运筹学学报,2005,9(1):13-20. |
| |
| 作者姓名： | 钟培华 孙小玲 |
| |
| 作者单位： | 1. 上海大学数学系,上海,200444;江西农业大学基础部
2. 江西农业大学基础部 |
| |
| 基金项目： | Research supported by and the National Natural Science Foundation of China under Grants 79970107 and 10271073. |
| |
| 摘 要： | 凹整数规划是一类重要的非线性整数规划问题，也是在经济和管理中有着广泛应用的最优化问题．本文主要研究用分枝定界方法求解凹整数规划问题，这一方法的基本思想是对目标函数进行线性下逼近，然后用乘子搜索法求解连续松弛问题．数值结果表明，用这种分枝定界方法求解凹整数规划是有效的．
|
| 关 键 词： | 分枝定界方法 求解 非线性整数规划 乘子 最优化问题 连续 逼近 经济 基本思想 管理 |
Computational Study of Branch-and-Bound Method for Concave Integer Programming |
| |
| Zhong Peihua,Sun Xiaoling.Computational Study of Branch-and-Bound Method for Concave Integer Programming[J].OR Transactions,2005,9(1):13-20. |
| |
| Authors: | Zhong Peihua Sun Xiaoling |
| |
| Institution: | Zhong Peihua Sun Xiaoling Department of Mathematics,Shanghai University,Shanghai 200444, Jiangxi Agricultural University |
| |
| Abstract: | Concave integer programming is an important class of nonlinear integer programming problems with applications in optimization models involving economies of scale. In this paper, we investigate branch-and-bound method for solving concave integer programming problems. The method is based on the linear underestimation of the objective function and continuous relaxation. The continuous subproblem at each node is solved by a special Lagrangian multiplier search procedure. Extensive computational experiment shows that the branch-and-bound method is efficient in solving concave integer programming problems. |
| |
| Keywords: | Operations research nonlinear integer programming concave knapsack problem branch-and-bound method linear underestimation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
