期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
The Optimality Conditions for Multiobjective Semi-infinite Programming Involving Generalized Unified (C, α, p, d)-convexity
1
作者 ZHANG Qing-xiang ZHANG Yong-zhan 《Chinese Quarterly Journal of Mathematics》 CSCD 2013年第2期241-249,共9页
The definition of generalized unified (C, α, ρ, d)-convex function is given. The concepts of generalized unified (C, α, ρ, d)-quasiconvexity, generalized unified (C, α, ρ, d)-pseudoconvexity and generalized unif... The definition of generalized unified (C, α, ρ, d)-convex function is given. The concepts of generalized unified (C, α, ρ, d)-quasiconvexity, generalized unified (C, α, ρ, d)-pseudoconvexity and generalized unified (C, α, ρ, d)-strictly pseudoconvex functions are presented. The sufficient optimality conditions for multiobjective nonsmooth semi-infinite programming are obtained involving these generalized convexity lastly. 展开更多
关键词 generalized convexity multiobjective semi-infinite programming efficient solution optimality conditions
下载PDF
一种半无限多目标规划离散型算法的偏差估计 被引量:2
2
作者 林路 《杭州师范学院学报(自然科学版)》 2006年第2期102-103,108,共3页
讨论一类半无限多目标规划离散型算法的偏差估计与算子逼近的关联,并给出相应的计算公式.
关键词 半无限多目标规划 离散型算法 偏差 算子逼近
下载PDF
Optimality Conditions for Minimax Optimization Problems with an Infinite Number of Constraints and Related Applications 被引量:2
3
作者 Li-nan ZHONG Yuan-feng JIN 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2021年第2期251-263,共13页
This paper is concerned with the study of optimality conditions for minimax optimization problems with an infinite number of constraints,denoted by(MMOP).More precisely,we first establish necessary conditions for opti... This paper is concerned with the study of optimality conditions for minimax optimization problems with an infinite number of constraints,denoted by(MMOP).More precisely,we first establish necessary conditions for optimal solutions to the problem(MMOP)by means of employing some advanced tools of variational analysis and generalized differentiation.Then,sufficient conditions for the existence of such solutions to the problem(MMOP)are investigated with the help of generalized convexity functions defined in terms of the limiting subdifferential of locally Lipschitz functions.Finally,some of the obtained results are applied to formulating optimality conditions for weakly efficient solutions to a related multiobjective optimization problem with an infinite number of constraints,and a necessary optimality condition for a quasiε-solution to problem(MMOP). 展开更多
关键词 minimax programming problem semi-infinite optimization limiting subdifferential multiobjective optimization approximate solutions
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部