一类灰正项几何规划的解法  

Solving method for a type gery posynomial geometric programming

作　　者：杨吉会[1] 

机构地区：[1]沈阳炮兵学院基础教研室,辽宁沈阳11016

出　　处：《辽宁工程技术大学学报（自然科学版）》2010年第5期937-940,共4页Journal of Liaoning Technical University (Natural Science)

基　　金：国家自然科学基金资助项目(70771030)

摘　　要：为了讨论一类系数和指数都是区间灰数的正项几何规划的求解方法,通过对区间灰数适当的白化后将灰正项几何规划转化成通常的正项几何规划,利用正项几何规划的对偶算法求出最优解。以区间灰数的形式给出了该类灰正项几何规划的最优解。丰富了正项几何规划的研究内容,扩展了正项几何规划的应用范围。in view of the solving method is researched about the posynomial geometric programming with interval grey coefficient and exponent. The gery posynomial geometric programming is transformed into classic one based on centain whtiening style,and the optimal solution of classic posynomial geometric programming is solved by the dual algorithm of classic posynomial geometric programming. The optimal solution.of gery posynomial geometric programming is given by interval grey number. The research content of posynomial geometric programming is enriched,and the range of its application is also expanded.

关 键 词：区间灰数 灰正项几何规划 对偶规划 最优解 

分 类 号：O189[理学—数学]