两人交叉规划问题的最优整体差解  

An optimal integral differential solution for a two-person interaction programming problem

作　　者：徐新生[1] 孙建武[1] 

机构地区：[1]滨州学院数学与信息科学系,山东滨州256603

出　　处：《山东大学学报（理学版）》2008年第12期52-55,60,共5页Journal of Shandong University(Natural Science)

基　　金：浙江省自然科学基金资助项目(606097);滨州学院科研基金资助项目(bzxykj0819)

摘　　要：引进了两人交叉规划问题的一种最优解概念:t*-最优整体差解,该解可以通过求解一个相应的数学规划问题得到。讨论了决策者具有不同让步值的t*-最优整体差解,给出了两人交叉规划问题的t*-最优整体差解和s-最优联合解之间的联系。数值例子表明该方法对于求解两人交叉规划问题具有一定的有效性。A new concept called the t^＊ -optimal integral differential solution for a two-person interaction programming problem （IPP） was introduced, where t^＊ is a non-negative constant. It can be shown that the t^＊ -optimal integral differential solution is equivalent to the optimal solution for another mathematical programmning problem. In addition, the t^＊-optimal integral differential solution that the giving-up value of each decision maker is different was discussed, the relation between the t^＊ -optimal integral differential solution and the s-optimal joint solution was also presented. A numerical example illustrated that the method presented here is efficient for solving a two-person interaction programmning problem.

关 键 词：交叉规划问题 s-最优联合解 t^＊-最优整体差解 

分 类 号：O342[理学—固体力学] O221.1[理学—力学]