Rough正项几何规划及其算法  

Rough posynomial geometric programming and its algorithm

作　　者：曹炳元[1] 

机构地区：[1]广州大学数学与信息科学学院,广东广州510006

出　　处：《广州大学学报（自然科学版）》2011年第1期1-7,共7页Journal of Guangzhou University:Natural Science Edition

基　　金：国家自然科学基金项目(70771030;70271047;79670012)资助;广州大学科学基金资助

摘　　要：在rough集合和rough凸集的基础上,提出了rough值集凸函数的概念,建立了rough正项几何规划的知识表示模型、数学模型.此外,研究了rough正项几何规划的数学模型,以及解决多反而少的"悖论"的rough正项几何规划的算法,它可以化为一单项rough正项几何规划后再化为一个rough线性规划来求解.最后,通过数值例证明这一模型和算法的有效性.A rough convex function concept is advanced in rough value sets on foundation of rough sets and rough convex sets.Besides,a knowledge expression model in rough posynomial geometric programming is established and so is a mathematical one.Thirdly,solution properties are studied in mathematical model of rough posynomial geometric programming,and antinomy of the more-for-less paradox is solved with an arithmetic in rough posynomial geometric programming given,which can be changed into a rough linear programming after monomial rough posynomial geometric programming is solved.Finally,validity in model and algorithm is verified by examples.

关 键 词：rough集合 rough凸集 正项几何规划 rough数 悖论 满意解 

分 类 号：O221.8[理学—运筹学与控制论]