一类大规模规划的分解协调过程

Decomposition Coordination Process for a Class of Large-Scale Programmings

本文针对一类大规模规划问题,将其分解成若干子规划和一个协调子规划,每个子规划又继续分解为若干个子规划。各个子规划独立求解,其间的耦合联系通过协调子规划来完成,反复分解协调,直至达到主规划的最优。

In this paper, a class of large - scale programmings is divided into some subprogrammings and one coordination subprogramming, each subpro-gramming is divided into sime subprogrammings again, each subprogramming is solved independently, their coupling relation is completed in coordination subprogramming. It is decomposed and coordinated repeatedly until the optimal solution of main programming is attained.