| 带多乘积约束的线性规划问题的求解新方法 |
| |
| 引用本文： | 申培萍,刘利敏,段运鹏.带多乘积约束的线性规划问题的求解新方法[J].河南师范大学学报(自然科学版),2007,35(3):209-211. |
| |
| 作者姓名： | 申培萍 刘利敏 段运鹏 |
| |
| 作者单位： | 河南师范大学,数学与信息科学学院,河南,新乡,453007 |
| |
| 基金项目： | 国家自然科学基金
,
国家社会科学基金
,
河南省软科学基金 |
| |
| 摘 要： | 根据问题的最优性和可行性提出一新的区域删除准则以排除问题(P)的可行域中不存在全局最优解的部分,结合区域删除准则和分支定界理论给出新算法.数值算例表明算法是有效可行的.
|
| 关 键 词： | 多乘积约束 区域删除准则 分支定界 |
| 文章编号： | 1000-2367（2007）03-0209-03 |
| 修稿时间： | 2006-08-23 |
A New Method for Solution of Linear Programming With Additional Multiplicative Constraints |
| |
| SHEN Pei-ping,LIU Li-min,DUAN Yun-peng.A New Method for Solution of Linear Programming With Additional Multiplicative Constraints[J].Journal of Henan Normal University(Natural Science),2007,35(3):209-211. |
| |
| Authors: | SHEN Pei-ping LIU Li-min DUAN Yun-peng |
| |
| Institution: | College of Mathematics and Information Science,Henan Normal University,Xinxiang 453007,China |
| |
| Abstract: | New region-deleting principles are proposed based on the optimality and feasibility of the problem so as to delete the subregion without containing the optimal solutions of the problem(P).The new algorithm is proposed by combining the region-deleting principles with branch and bound theories.The numerical examples show the algorithm is feasible and effective. |
| |
| Keywords: | multiplicative constraints region-deleting principles branch and bound |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
