%0 Journal Article
%A WANG Mengdan
%A WANG Jiaolang
%T Mixed Type Duality for a New Class of Non-Convex Robust Optimization Problems
%D 2024
%R 10.13438/j.cnki.jdzk.2024.01.002
%J Journal of Jishou University(Natural Sciences Edition)
%P 7-12
%V 45
%N 1
%X We first introduced a new class of non-convex robust optimization problems,whose objective functions and constraint functions are α-convex functions and defined the mixed-type approximate dual problem of the new problems.Then,by using the properties of the Frechet subdifferentials,the optimality conditions of approximate solution are introduced.At the same time,some results for the weak duality,strong duality and converse-like duality theorems between the non-convex robust optimization problem and its mixed type dual problem are also given.
%U https://zkxb.jsu.edu.cn/EN/10.13438/j.cnki.jdzk.2024.01.002