On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems

On approximate positively properly efficient solutions in nonsmooth semi-infinite multiobjective optimization problems with data uncertainty

“…In addition, since sometimes exact solutions do not exist while the approximate ones do, even in the convex case (see [27,28]), the study of approximate solutions becomes significant from both the theoretical aspect and computational applications. Optimality conditions and duality theorems for approximate solutions of a multiobjective optimization problems were studied in [29,30,31] and optimality conditions/duality theorems/saddle point theorems for approximate solutions of optimization problems with infinite constraints were given in [32,33,34,35,36,37,38,39]. On the other hand, optimality conditions/duality theorems for approximate solutions of robust optimization problems with infinite constraints were obtained in [40,41,42].…”