|
|||||
|
|
| 具有独立子块的大系统目标规划问题的解法 | |
| 引用本文： | 冯英浚 张杰. 具有独立子块的大系统目标规划问题的解法[J]. 运筹学学报, 1998, 2(2): 25-30 |
| 作者姓名： | 冯英浚 张杰 |
| 作者单位： | 哈尔滨工业大学应用数学系!哈尔滨，150001，哈尔滨工业大学应用数学系!哈尔滨，150001 |
| 摘 要： | 分解之后如何进行协调解决大系统规划问题的关键．本文通过利用子系统目标值所提供的信息进行大系统分解之后的协调，并提出了求解具有独立子块的大系统规划问题的串式调优法，同时研究了有关原问题和各子问题最优解的性质． |
| 关 键 词： | 大系统 目标规划 串式调优法 |
The Solution on Goal Programming of Larges Scale with Independent Subsystems |
|
| YINGJUN FENG, JIE ZHANG. The Solution on Goal Programming of Larges Scale with Independent Subsystems[J]. OR Transactions, 1998, 2(2): 25-30 | |
| Authors: | YINGJUN FENG JIE ZHANG |
| Abstract: | 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. |
| Keywords: | Large scale Goal programming Serial adjustment method |
| 本文献已被 CNKI 维普 等数据库收录！ | |