弱半E-凸规划问题的最优性条件

doi:10.15960/j.cnki.issn.1007-6093.2025.04.006

运筹学学报（中英文） ›› 2025, Vol. 29 ›› Issue (4): 72-82.doi: 10.15960/j.cnki.issn.1007-6093.2025.04.006

• • 上一篇

弱半E-凸规划问题的最优性条件

王小芳, 梁治安†, 高彩霞

内蒙古大学数学科学学院, 内蒙古呼和浩特 010021

收稿日期:2022-11-16 发布日期:2025-12-11
通讯作者: 梁治安 E-mail:zhianl@163.com
基金资助:
国家自然科学基金(No.12461057)

Optimality conditions of weakly semi-E-convex programming

WANG Xiaofang, LIANG Zhian†, GAO Caixia

School of Mathematics and Science, Inner Mongolia University, Hohhot 010021, Inner Mongolia, China

Received:2022-11-16 Published:2025-12-11

摘要/Abstract

摘要： 本文引入了一类新的广义凸函数: 弱半$E$-凸函数, 建立了其对应的弱半$E$-凸规划问题; 讨论了弱半$E$-凸规划问题的解的性质, 并给出弱半$E$-凸规划问题的最优性条件。

关键词: 弱半$E$-凸函数, 弱半$E$-凸规划问题, 鞍点, 稳定点, 最优性条件

Abstract: In this paper, we introduce a new class of generalized convex functions: weakly semi-$E$-convex functions and establish its corresponding weakly semi-$E$-convex programming. We discuss the properties of solutions of weakly semi-$E$-convex programming and give the optimality conditions of weakly semi-$E$-convex programming.

Key words: weakly semi-$E$-convex functions, weakly semi-$E$-convex programming, saddle points, stable points, optimality conditions

中图分类号:

O221.2

王小芳, 梁治安, 高彩霞. 弱半E-凸规划问题的最优性条件[J]. 运筹学学报（中英文）, 2025, 29(4): 72-82.

WANG Xiaofang, LIANG Zhian, GAO Caixia. Optimality conditions of weakly semi-E-convex programming[J]. Operations Research Transactions, 2025, 29(4): 72-82.

参考文献

[1] Youness E A. E-convex sets, E-convex functions and E-convex programming [J]. Journal of Optimization Theory and Applications, 1999, 102(2): 439-450.
[2] Duca D I, Lupsa L. On the E-epigraph of an E-convex function [J]. Journal of Optimization Theory and Applications, 2006, 129(2): 341-348.
[3] 宁刚. $E$-凸函数的若干特征[J]. 运筹学学报， 2007, 11(1): 121-126.
[4] 姜艮, 刘学文, 王岗, 等. $E$-凸规划问题解集的刻画[J]. 运筹学学报, 2012, 16(3): 75-83.
[5] Majeed S N, Abd Al-Majeed M I. On convex functions, E-convex functions and their generalizations: Applications to non-linear optimization problems [J]. International Journal of Pure and Applied Mathematics, 2017, 116(3): 655-673.
[6] Fulga C, Preda V. Nonlinear programming with E-preinvex and local E-preinvex functions [J]. European Journal of Operational Research, 2009, 192(3): 737-743.
[7] Syau Y R, Jia L X, Lee E S. Generalizations of E-convex and B-vex functions [J]. Computers & Mathematics with Applications, 2009, 58(4): 711-716.
[8] Soleimani-damane M. E-convexity and its generalizations [J]. International Journal of Computer Mathematics, 2011, 88(16): 3335-3349.
[9] Iqbal A, Ali S, Ahmad I. On geodesic E-convex sets, geodesic E-convex functions and Eepigraphs [J]. Journal of Optimization Theory and Applications, 2012, 155(1): 239-251.
[10] Nanda S. On generalization of E-convex and composite functions [J]. Journal of Information and Optimization Sciences, 2021, 42(6): 1271-1282.
[11] Yang X M. On E-convex functions and E-convex programming [J]. Journal of Optimization Theory and Applications, 2001, 109(3): 699-703.
[12] Jian J B. Incorrect results for E-convex functions and E-convex programming [J]. Journal of Mathematical Research and Exposition, 2003, 23(3): 461-466.
[13] Chen X S. Some properties of semi-E-convex functions [J]. Journal of Mathematical Analysis and Applications, 2002, 275(1): 251-262.
[14] Chen X S. On semi-E-convex function and semi-E-convex programming [C]//中国企业运筹学学术交流大会, 2007: 179-182.
[15] Boyd S P, Vandenberghe L. Convex Optimization [M]. Cambridge: Cambridge University Press, 2004.
[16] Rockafellar R T. Convex Analysis [M]. Princeton: Princeton University Press, 1970.
[17] Mangasarian O L. Nonlinear Programming [M]. New York: McGraw-Hill, 1979.
[18] Youness E A. Optimality criteria in E-convex programming [J]. Chaos, Solitons & Fractals, 2001, 12(9): 1737-1745.

弱半E-凸规划问题的最优性条件

Optimality conditions of weakly semi-E-convex programming

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

[1]	王晓. 非凸约束优化的随机近似算法[J]. 运筹学学报, 2023, 27(4): 153-165.
[2]	王海军, 王辉辉. 带消失约束的区间值优化问题的最优性条件与对偶定理[J]. 运筹学学报, 2023, 27(1): 87-102.
[3]	黎君, 陈加伟, 邓光菊. 广义凸区间值优化问题的最优性条件[J]. 运筹学学报, 2020, 24(4): 25-38.
[4]	高雷阜, 闫婷婷. 均衡约束数学规划问题的一类广义Mond-Weir型对偶理论[J]. 运筹学学报, 2019, 23(2): 95-103.
[5]	陈瑞婷, 徐智会, 高英. 拟凸多目标优化问题近似解的最优性条件[J]. 运筹学学报, 2019, 23(1): 35-44.
[6]	王硕, 朱志斌, 张本鑫. 最小化三个凸函数之和的一个简单原始-对偶算法[J]. 运筹学学报, 2018, 22(2): 127-138.
[7]	陈林, 杨新民. 一类带概率互补约束的随机优化问题的最优性条件[J]. 运筹学学报, 2017, 21(2): 24-30.
[8]	袁春红. 集值映射多目标半定规划问题的epsilon-弱有效性[J]. 运筹学学报, 2017, 21(1): 23-32.
[9]	张亮,王燕,李国权. 双值约束非凸三次规化问题的全局最优性条件[J]. 运筹学学报, 2015, 19(2): 83-90.
[10]	刘水霞, 陈国庆. 求解互补约束优化问题的乘子松弛法[J]. 运筹学学报, 2014, 18(4): 119-130.
[11]	黎健玲, 谢琴, 简金宝. 均衡约束数学规划的约束规格和最优性条件综述[J]. 运筹学学报, 2013, 17(3): 73-85.
[12]	李丽花, 高岩, 王隔霞. 一类变结构动态系统的非光滑最优性条件[J]. 运筹学学报, 2013, 17(3): 65-72.
[13]	晁绵涛, 简金宝, 梁东颖. 次b凸函数和次b凸规划[J]. 运筹学学报, 2012, 16(2): 1-8.
[14]	刘水霞, 陈国庆. 互补约束优化问题的乘子序列部分罚函数算法[J]. 运筹学学报, 2011, 15(4): 55-64.
[15]	白乙拉, 吕巍. 一类非光滑分布参数系统的可辨识性及最优性条件[J]. 运筹学学报, 2011, 15(2): 119-126.