A ROBUST DECOMPOSITION OF LINEAR PROGRAMMING USING A GOAL-PARTITIONING METHOD

(整期优先)网络出版时间:1991-01-11
/ 1
TheDantzig/Wolfelinearprogrammingdecompositionalgorithmhashadimportanteconomicinterpretationsaswellasawidespreadimpactonsolvinglargescalelinearprogrammingproblem.Inthispaperweconsiderasimilarunderlyingstructure,wherehoweverthereisonlyonecouplinginequalityorequation.Withthissimplification,wedemonstratehowtoachieveanequitablepartitionoftheoverallcouplingresourcetoinpidualsubproblemconstraintsthroughasimpleiterationprocedurewhichappearstobeveryefficient.