OPTIMALITY_CONDITIONS

作品数：64被引量：80H指数：5
导出分析报告
相关作者：冯强王荣波张庆祥更多>>
相关机构：延安大学南昌大学更多>>
相关期刊：《Computer Modeling in Engineering & Sciences》《Journal of Computational Mathematics》《Applied Mathematics and Mechanics(English Edition)》《Journal of Systems Science and Systems Engineering》更多>>
相关基金：国家自然科学基金山东省自然科学基金中国博士后科学基金陕西省教育厅科研计划项目更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Journal of Systems Science & Complexityx
共 条 记 录，以下是1-7
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Optimality Conditions and Duality for Nondifferentiable Multiobjective Semi-Infinite Programming Problems with Generalized(C,α,ρ,d)-Convexity被引量：6
《Journal of Systems Science & Complexity》2015年第1期47-59,共13页MISHRA Shashi Kant JAISWAL Monika HOAI AN Le Thi 
This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized(C,α,ρ,d)-convex functions.The authors formulate Mond-Weir-...
关键词：DUALITY generalized convexity optimality conditions semi-infinite programming. 
MINIMAX PROGRAMMING UNDER GENERALIZED （p, r）-INVEXITY
《Journal of Systems Science & Complexity》2007年第4期501-508,共8页S. K. MISHRA Shouyang WANG K. K. LAI 
Minimax programming problems involving generalized （p, r）-invex functions are consid- ered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the obje...
关键词：DUALITY minimax programming optimality conditions （p r）-invex functions. 
THE WEAK BENSON PROPER EFFICIENT SUBGRADIENT AND THE OPTIMALITY CONDITIONS OF SET-VALUED OPTIMIZATION被引量：5
《Journal of Systems Science & Complexity》2002年第1期69-76,共8页SHENG Baohuai (Institute of Mathematics, Ningbo University, Ningbo 315211 Department of Applied Mathematics, Xidian University, Xi’an 710071,China) 
This research is supportedby the National Natural Science Foundation of China(69972036), the Natural Science Foundation of Shaan
The subgradient, under the weak Benson proper efficiency, of a set-valued mapping in ordered Banach space is developed, and the weak Benson proper efficient Hahn-Banach theorem of a set-valued mapping is established, ...
关键词：Weak Benson proper efficient elements Hahn-Banach theorem weak Benson properefficient subgradient. 
NONCONICAL NONSMOOTH MULTIOBJECTIVE PROGRAMMING-OPTIMALITY CONDITIONS AND
《Systems Science and Mathematical Sciences》1998年第1期61-68,共8页DUALITY THEOREMSLI Yuan-xi(Departtnent of Statistics and OR, Fudan University, Shanghai 200433, China) 
This paper deals with Nonconical Nonsmooth Multiobjective ProgrammingProblem. The generalized directional deriVate of a maPping w.r.t a binary relation andthe derivate of a binary relation are illtroduced and used as ...
关键词：BINARY RELATION generalized directional derivate deriVate of a BINARY RELATION MULTIOBJECTIVE programming OPTIMALITY condition DUALITY theorem. 
OPTIMALITY CONDITIONS FOR NONCONVEX BILEVEL PROGRAMMING PROBLEMS被引量：2
《Systems Science and Mathematical Sciences》1997年第2期183-192,共10页LIU Guoshan HAN Jiye (Institute of Aoolied Mathematics, Academia Sinica, Beijing 100080, China) 
In this paper, we derive an exact penalty function for nonconvex bilevel programming problem based on its KS form. Based on this exact penalty function a sufficient condition for KS to be partially calm is presented a...
关键词：OPTIMALITY conditions NONCONVEX bilevel programming problem EXACT PENALTY FUNCTION value FUNCTION constraint qualification. 
OPTIMALITY CONDITIONS IN NONSMOOTH MULTIOBJECTIVE PROGRAMMING
《Systems Science and Mathematical Sciences》1994年第3期250-255,共6页WANG Liancheng DONG Jiali LIU Qinghuai (Depertment of Mathematics, Jilin University of Technology, Changchun 130025, China) 
ＯＰＴＩＭＡＬＩＴＹＣＯＮＤＩＴＩＯＮＳＩＮＮＯＮＳＭＯＯＴＨＭＵＬＴＩＯＢＪＥＣＴＩＶＥＰＲＯＧＲＡＭＭＩＮＧ￥ＷＡＮＧＬｉａｎｃｈｅｎｇ；ＤＯＮＧＪｉａｌｉ；ＬＩＵＱｉｎｇｈｕａｉ（ＤｅｐｅｒｔｍｅｎｔｏｆＭａｔ...
关键词：MULTIOBJECTIVE PROGRAMMING generalized gradient separation THEOREM WEAK Pareto-efficient solution. 
THE OPTIMALITY CONDITIONS OF D-PSEUDOCONVEX PROGRAMMING WITH OPERATOR CONSTRAINTS
《Systems Science and Mathematical Sciences》1992年第2期111-120,共10页ZHANG Huaxiao JIN Yuefeng HE Lunzhi 
supported by National Natural Science Foundation of China
The problem of D-pseudoconvex programming with operator con-straints is discussed in this paper.Some new optimality conditions are presentedand an error made by V.Barbu in [4] is pointed out.
关键词：D-pseudoconvex programming operator constraints 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部