摘要
TheDantzig/Wolfelinearprogrammingdecompositionalgorithmhashadimportanteconomicinterpretationsaswellasawidespreadimpactonsolvinglargescalelinearprogrammingproblem.Inthispaperweconsiderasimilarunderlyingstructure,wherehoweverthereisonlyonecouplinginequalityorequation.Withthissimplification,wedemonstratehowtoachieveanequitablepartitionoftheoverallcouplingresourcetoindividualsubproblemconstraintsthroughasimpleiterationprocedurewhichappearstobeveryefficient.
出版日期
1991年01月11日（中国期刊网平台首次上网日期，不代表论文的发表时间）
