Existence and optimality conditions for approximate solutions to vector optimization problems (Q2429404): Difference between revisions

The authors consider a general vector optimization problem \[ \text{minimize}\qquad f(x)\text{ subject to }x\in S,\tag{\(*\)} \] where \(f: X\to Y\), \(X\) is a nontrivial complete metric space and \(Y\) is a locally convex Hausdorff space. It is assumed that \(S\) is a nonempty subset of \(X\). A general concept of \(\varepsilon\)-efficiency for vector optimization problems is introduced, various types of \(\varepsilon\)-efficient solutions of the optimization problem are defined. These solutions represent various types of approximate solutions of problem \((*)\). Properties of the \(\varepsilon\)-efficient solutions of \((*)\) are proved and conditions for their existence are studied. Linear scalarization and Lagrange multiplier rule for the approximate solutions are derived under appropriate assumptions.