| A ROBUST DECOMPOSITION OF LINEAR PROGRAMMING USING A GOAL-PARTITIONING METHOD |
| |
| 作者姓名： | 陶惠民 朱纪善 |
| |
| 作者单位： | Department of Mathematics Tianjin Institute of Technology，Tianjin 300191，China，Department of Management Sciences，The University of Iowa，Iowa city，U.S.A. |
| |
| 摘 要： | 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.
|
A ROBUST DECOMPOSITION OF LINEAR PROGRAMMING USING A GOAL-PARTITIONING METHOD |
| |
| Tao Huimin.A ROBUST DECOMPOSITION OF LINEAR PROGRAMMING USING A GOAL-PARTITIONING METHOD[J].Journal of Systems Science and Complexity,1991(1). |
| |
| Authors: | Tao Huimin |
| |
| Abstract: | The Dantzig/Wolfe linear programming decomposition algorithm has had important economic
interpretations as well as a widespread impact on solving large scale linear programming problem.In
this paper we consider a similar underlying structure,where however there is only one coupling
inequality or equation.With this simplification,we demonstrate how to achieve an equitable partition
of the overall coupling resource to individual subproblem constraints through a simple iteration
procedure which appears to be very efficient. |
| |
| Keywords: | Linear programming decomposition principal optimal resource partition economic interpretation robust goals |
| 本文献已被 CNKI 等数据库收录！ |
