首页 | 本学科首页   官方微博 | 高级检索  
     

A ROBUST DECOMPOSITION OF LINEAR PROGRAMMING USING A GOAL-PARTITIONING METHOD
引用本文:陶惠民,朱纪善. A ROBUST DECOMPOSITION OF LINEAR PROGRAMMING USING A GOAL-PARTITIONING METHOD[J]. 系统科学与复杂性, 1991, 0(1)
作者姓名:陶惠民  朱纪善
作者单位: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, 0(1)
Authors:Tao Huimin
Abstract: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.
Keywords:Linear programming  decomposition principal  optimal resource partition  economic interpretation  robust goals
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号