| 符号几何规划及其可行域修正算法 |
| |
| 引用本文： | 袁云耀,贺国平,隋树林. 符号几何规划及其可行域修正算法[J]. 山东科技大学学报(自然科学版), 1997, 0(1) |
| |
| 作者姓名： | 袁云耀 贺国平 隋树林 |
| |
| 作者单位： | 青岛化工学院 |
| |
| 摘 要： | 本文脱离了影响较广泛的文献１、２的思路，不依赖反向几何规划，直接讨论符号几何规划，不增变量个数和约束个数。利用集约化思想构造了一个可行城修正算法。本文还对文献２中的一个疏漏作了修改，增补了文献２的内容
|
| 关 键 词： | 几何规划；符号几何规划；算法 |
Symbolic Geometric Programmingand a Feasible Region Modified Algorithm |
| |
| Yan Yunyao. Symbolic Geometric Programmingand a Feasible Region Modified Algorithm[J]. Journal of Shandong Univ of Sci and Technol: Nat Sci, 1997, 0(1) |
| |
| Authors: | Yan Yunyao |
| |
| Affiliation: | Yan Yunyao(Jinan Branch of Shandong Mining Institute) He Guoping(Department of Applied Mathematics and Software Engineering) Sui Shulin(Qingdao Institute of Chemical Technology) |
| |
| Abstract: | In this paper,with a new thinking independent of that of Ref.,the symbolic geometric programming problem is considered directly without use of inverse geometric programming.The number of variables and constraints is not increased. A new feasible region modification algorithm is presented by a concentration method.A careless mistake of Ref. is corrected, and some extension of Ref. is proposed. |
| |
| Keywords: | geometric programming symbolic geometric programming algorithm feasible region modification concentration method |
| 本文献已被 CNKI 等数据库收录！ |
