节点文献
带多乘积约束的线性规划问题的求解新方法
A New Method for Solution of Linear Programming With Additional Multiplicative Constraints
【摘要】 根据问题的最优性和可行性提出一新的区域删除准则以排除问题(P)的可行域中不存在全局最优解的部分,结合区域删除准则和分支定界理论给出新算法.数值算例表明算法是有效可行的.
【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.
【关键词】 多乘积约束;
区域删除准则;
分支定界;
【Key words】 multiplicative constraints; region-deleting principles; branch and bound;
【Key words】 multiplicative constraints; region-deleting principles; branch and bound;
【基金】 国家自然科学基金(10671057);国家社会科学基金(05XRK008);河南省软科学研究计划(0513030920)
- 【文献出处】 河南师范大学学报(自然科学版) ,Journal of Henan Normal University(Natural Science) , 编辑部邮箱 ,2007年03期
- 【分类号】O221.1
- 【被引频次】2
- 【下载频次】109