首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一类不可微规划的高阶对称对偶性
引用本文:陈秀宏.一类不可微规划的高阶对称对偶性[J].应用数学,2004,17(3):370-374.
作者姓名:陈秀宏
作者单位:淮阴师范学院数学系,江苏,淮安,223001
基金项目:SupportedinpartbytheNaturalScienceFoundationofJiangsuHighSchool(0 3KJB110 0 12 )andJiangsuEducationOffice (0 0KJD110 0 0 1,0 1KJD110 0 0 5
摘    要:本文我们利用一个可微函数给出了一对高阶对称规划问题 ,其中目标函数包含了Rn 中一紧凸集的支撑函数 .在引入高阶F 凸性 (F 伪凸性 ,F 拟凸性 )后 ,证明了高阶弱、高阶强及高阶逆对称对偶性质 .

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

Higher-order Symmetric Duality for a Class of Nondifferentiable Programs
Abstract.Higher-order Symmetric Duality for a Class of Nondifferentiable Programs[J].Mathematica Applicata,2004,17(3):370-374.
Authors:Abstract
Abstract: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.
Keywords:Nonlinear nondifferentiable programs  Higher-order symmetric duality  Higher-order F-convexity  Support function
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号