一类不可微规划的高阶对称对偶性(英文)  

Higher-order Symmetric Duality for a Classof Nondifferentiable Programs

作　　者：陈秀宏[1] 

机构地区：[1]淮阴师范学院数学系,江苏淮安223001

出　　处：《应用数学》2004年第3期370-374,共5页Mathematica Applicata

基　　金：SupportedinpartbytheNaturalScienceFoundationofJiangsuHighSchool(0 3KJB110 0 12 )andJiangsuEducationOffice (0 0KJD110 0 0 1,0 1KJD110 0 0 5

摘　　要：本文我们利用一个可微函数给出了一对高阶对称规划问题 ,其中目标函数包含了Rn 中一紧凸集的支撑函数 .在引入高阶F 凸性 (F 伪凸性 ,F 拟凸性 )后 ,证明了高阶弱、高阶强及高阶逆对称对偶性质 .In this paper,we formulate a pair of higher-order symmetric models by using a differentiable function,where the objective functions contain a support function of a compact convex set in Rn.We introduce the concept of higher-order F-convexity (F-pseudo-convexity,F-quasi-convexity),and establish the higher-order weak,higher-order strong and higher-order converse duality theorems.

关 键 词：不可微规划 高阶对称对偶性 高阶F-凸性 支撑函数 

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