Locally Lipschitz vector optimization with inequality and equality constraints
Ivan Ginchev, Angelo Guerraggio, Matteo Rocca · Applications of Mathematics · 2010
The present paper studies the following constrained vector optimization problem: $$\mathop {\min }\limits_C f(x),g(x) \in - K,h(x) = 0$$ , where f: ℝ n → ℝ m , g: ℝ n → ℝ p are locally Lipschitz functions, h: ℝ n → ℝ q is C 1 function, and C ⊂ ℝ m and K ⊂ ℝ p are closed convex cones. Two types of solutions are important for the consideration, namely w-minimizers (weakly efficient points) and i-minimizers (isolated minimizers of order 1). In terms of the Dini directional derivative first-order necessary conditions for a point x 0 to be a w-minimizer and first-order sufficient conditions for x 0 to be an i-minimizer are obtained. Their effectiveness is illustrated on an example. A comparison with some known results is done.