符号几何规划及其可行域修正算法  

Symbolic Geometric Programmingand a Feasible Region Modified Algorithm

作　　者：袁云耀 贺国平[1] 隋树林[1] 

机构地区：[1]青岛化工学院

出　　处：《山东矿业学院学报》1997年第1期86-93,共8页Journal of Shandong University of Science and Technology(Natural Science)

基　　金：山东省自然科学基金

摘　　要：本文脱离了影响较广泛的文献１、２的思路，不依赖反向几何规划，直接讨论符号几何规划，不增变量个数和约束个数。利用集约化思想构造了一个可行城修正算法。本文还对文献２中的一个疏漏作了修改。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.

关 键 词：可行域修正 集约化 符号几何规划 

分 类 号：O156.3[理学—数学]