Operations Research Transactions ›› 2026, Vol. 30 ›› Issue (2): 159-168.doi: 10.15960/j.cnki.issn.1007-6093.2026.02.012

Previous Articles     Next Articles

Pseudo-E-convex functions without differentiability condition and optimality of pseudo-E-convex programming

HUANG Yingquan1,2,†, JIANG Xuyu3, SONG Guihua3, YANG Han3   

  1. 1 School of Mathematics and Statistics, Chongqing Technology and Business University, Chongqing 400067, China;
    2 Chongqing Key Laboratory of Statistical Intelligent Computing and Monitoring, Chongqing 400067, China;
    3 School of Mathematics and Statistics, Chongqing Jiaotong University, Chongqing 400074, China
  • Received:2025-08-23 Published:2026-06-12

Abstract: Firstly, a class of pseudo-E-convex functions without differentiability condition is defined in this paper, which is a proper generalization of E-convex functions and pseudoconvex functions without differentiability condition. The existence of such functions is verified with an example. Furthermore, the relationships between pseudo-E- convex functions and other functions are discussed. These indicate that pseudo-E-convex functions without differentiability condition are more general and have a wider range of applications. Secondly, some properties of pseudo-E-convex functions are obtained. Finally, in terms of optimality, the relationship between the fixed points of the mapping E and their global optimal solutions is discussed for the pseudo-E-convex programming problems ($\mathrm{P}$) and ($\mathrm{P}_{E}$), the local-global property of the optimal solutions and the uniqueness of the global optimal solution for programming problem ($\mathrm{P}$) are obtained, and the examples are provided to verify the results respectively.

Key words: (strictly) pseudo-E-convex functions, pseudo-E-convex programming, optimal solutions

CLC Number: