Robust Radius Of A Class Of Convex Inequality Systems And Optimality Conditions Of Uncertain Complex Fractional Programming Problems

In this paper,we study the optimality conditions of robust radius and uncertain complex fractional programming for convex inequality systems.First,we establish the upper and lower bounds of robust feasible radius and characterize its positivity.Secondly,we obtain the exact formula of robust feasible radius for convex inequality systems when the uncertainty set is asymmetric or symmetric,In addition,for the uncertain complex fractional programming problem,it is proved that the fractional programming problem is equivalent to the non fractional problem with given parameters,and then the necessary optimality conditions are established in the case of differentiability and non differentiability,In this paper,the sufficient optimality conditions of uncertain complex fractional programming are given.