\(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions (Q1340552)

This paper is concerned with a vector minimization problem and the corresponding \(\varepsilon\)-approximate optimal solutions. The problem is transformed into an unconstrained problem by using an exact penalty function. Consequently optimality criteria are derived by estimating the size of the penalty parameter in terms of \(\varepsilon\)-approximate solutions of the dual problems.