Acta mathematica scientia,Series A ›› 2025, Vol. 45 ›› Issue (2): 640-652.

Previous Articles    

Characterizations of Approximate Solution and Approximate Duality for Quasiconvex Programming

Donghui Fang*(),Junying Wang()   

  1. College of Mathematics and Statistics, Jishou University, Hunan Jishou 416000
  • Received:2024-07-10 Revised:2024-10-05 Online:2025-04-26 Published:2025-04-09
  • Contact: Donghui Fang E-mail:dh_fang@jsu.edu.cn;1070938151@qq.com
  • Supported by:
    NSFC(12261037);NSF of Hunan Province(2024JJ7396)

Abstract:

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.

Key words: quasiconvex programming, quasi (α,ε)-optimal solution, approximate saddle point theorem, mixed type duality

CLC Number: 

  • O224
Trendmd