拟凸规划近似解的特征刻画和近似对偶理论  

Characterizations of Approximate Solution and Approximate Duality for Quasiconvex Programming

作　　者：方东辉[1] 王俊颖 Fang Donghui;Wang Junying(College of Mathematics and Statistics,Jishou University,Hunan Jishou 416000)

机构地区：[1]吉首大学数学与统计学院,湖南吉首416000

出　　处：《数学物理学报(A辑)》2025年第2期640-652,共13页Acta Mathematica Scientia

基　　金：国家自然科学基金(12261037);湖南省自然科学基金(2024JJ7396)。

摘　　要：利用函数的近似次微分性质和拟凸函数的生成集的概念,引入一类新的约束规范条件,建立了拟凸规划问题拟(α,ε)-最优解的特征刻画,近似鞍点定理及混合型对偶理论.By using the properties of the approximate subdifferentials of involved functions and generators of quasiconvex functions,we introduce a new constraint qualification.Under this constraint qualification,characterizations of the quasi(α,ε)-optimal solution,the approximate saddle point theorems and the approximate mixed type duality theorems for quasiconvex programming are established.

关 键 词：拟凸规划 拟(α ε)-最优解 近似鞍点定理 混合型对偶 

分 类 号：O224[理学—运筹学与控制论]