期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A ROBUST DECOMPOSITION OF LINEAR PROGRAMMING USING A GOAL-PARTITIONING METHOD
1
作者 陶惠民 朱纪善 《Systems Science and Mathematical Sciences》 SCIE EI CSCD 1991年第1期68-77,共10页
The Dantzig/Wolfe linear programming decomposition algorithm has had important economicinterpretations as well as a widespread impact on solving large scale linear programming problem.Inthis paper we consider a simila... The Dantzig/Wolfe linear programming decomposition algorithm has had important economicinterpretations as well as a widespread impact on solving large scale linear programming problem.Inthis paper we consider a similar underlying structure,where however there is only one couplinginequality or equation.With this simplification,we demonstrate how to achieve an equitable partitionof the overall coupling resource to individual subproblem constraints through a simple iterationprocedure which appears to be very efficient. 展开更多
关键词 Linear PROGRAMMING DECOMPOSITION principal optimal RESOURCE PARTITION economic interpretation ROBUST goals
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部