Resumen de An approach to characterizing €‑solution sets of convex programs

N. V. Tuyen, C. F. Wen, T.Q. Son

• In this paper, we propose an approach to characterizing 휖-solution sets of convex programs with a given � > 0. The results are divided into two parts. The frst one is devoted to establishing the expressions of 휖-solution sets of a class of convex infnite programs. The representation is given based on the study of relationships among the following three sets: the set of Lagrange multipliers corresponding to a given 휖 -solution, the set of 휖-solutions of the dual problem corresponding, and the set of 휖 -Kuhn–Tucker vectors associated with the problem in consideration. The second one is devoted to some special cases: the 휖-solution sets of convex programs that have set constraints and the almost 휖-solution sets of convex programs that have fnite convex constraints. Several examples are given.