摘要
分解之后如何进行协调解决大系统规划问题的关键．本文通过利用子系统目标值所提供的信息进行大系统分解之后的协调，并提出了求解具有独立子块的大系统规划问题的串式调优法，同时研究了有关原问题和各子问题最优解的性质．
To solve large scale programming, adjustment is the key point after decomposition. In this paper based on the information about their goal values, the subsystems are adjusted after decomposition. A new solution-serial adjustment method (SA) has been presented and finally the characteristics of the optimal solution between each subproblem have been studied.
出处
《运筹学学报》
CSCD
1998年第2期25-30,共6页
Operations Research Transactions
基金
国家自然科学基金
