| 凸约束不定二次规划问题的分枝定界方法 |
| |
| 引用本文： | 张玉岩,钱伟懿.凸约束不定二次规划问题的分枝定界方法[J].渤海大学学报(自然科学版),2007,28(2):166-168. |
| |
| 作者姓名： | 张玉岩 钱伟懿 |
| |
| 作者单位： | 绥化学院,数学系,黑龙江,绥化,152061;渤海大学,数学系,辽宁,锦州,121013;渤海大学,数学系,辽宁,锦州,121013 |
| |
| 摘 要： | 针对凸约束不定二次规划问题，给出一个分枝界定方法。通过将凸约束不定二次规划问题等价地转化为凸凹规划问题，利用超矩形体的二分技术和锥剖分技术，在超矩形体上确定原问题的最优解，并进行了收敛性分析。
|
| 关 键 词： | 不定二次规划 凸凹规划 线性规划 分枝定界方法 锥剖分 整体优化 |
| 文章编号： | 1673-0569（2007）02-0166-03 |
| 修稿时间： | 2006-11-06 |
Branch-and-bound method for indefinite quadratic programming problems under convex constraints |
| |
| ZHANG Yu-yan,QIAN Wei-yi.Branch-and-bound method for indefinite quadratic programming problems under convex constraints[J].Journal of Bohai University:Natural Science Edition,2007,28(2):166-168. |
| |
| Authors: | ZHANG Yu-yan QIAN Wei-yi |
| |
| Institution: | 1. Department of Mathematics, Snihua Uuiversity, Suihua 152061 ,China ; 2. Department of Mathematics, Bohai University, Jinzhou 121013,China |
| |
| Abstract: | A brance-and-bound method is provided for the indefinite quadratic programming problems under convex constraints. By equally converting the indefinite quadratic programming problems under convex constraint into convex concave problems, and by using super rectangle dissection skill and cone dissection skill, the optimal solution to the original problems is determined from the super rectangle,and the convergence is analyzed. |
| |
| Keywords: | indefinite quadratic programming convex concave programming linear programming branch-and-bound method cone dissection global optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
