Fuzzy正项几何规划的直接算法

Direct Algorithms of Fuzzy Posynomial Geometric Programming

将 Fuzzy正项几何规划化为一变量有上、下界限制的 Fuzzy正项几何规划 ,利用 Fuzzy几何不等式 ,又将该变量有上、下界限制的 Fuzzy正项几何规划化为单项 Fuzzy正项几何规划 ,提出基于 Fuzzy值集割平面法的两种直接算法 ,并通过一个数值例证实该方法的有效性。

This paper aims at turning a fuzzy posynomial geometric programming into another one with a variable subject to upper and lower bounds. Besides, by the aid of fuzzy geometric inequality, the latter is to be changed into a single term fuzzy posynomial geometric one and, based on cutting plane method in fuzzy valued sets, two direct algorithms are advanced, by which a more general fuzzy geometric programming is solved. Finally, its effectiveness is proved by numerical examples.