Optimality conditions for multiobjective optimization problem constrained by parameterized variational inequalities
A multiobjective problem in finite-dimensional spaces with a parameterized variational inequality is considered, where at the end the feasible set \(B\) is convex by the given assumptions. First by the validity of Theorem 3.1, the problem is equivalent to a family of usual problems with linear scalarizations of the multiobjective. Theorem 3.2 derives a Karush-Kuhn-Tucker statement for the family of scalarized problems. In Chapter 4, the used coderivative for the Jacobian of the constraint function \(g\) in connection with the normal cone is estimated. It gives more detailed optimality conditions for the parametric family. Examples illustrate the theory. Reviewer's remark: However, at least the proofs of both statements of the basic Theorem 3.1 are incorrect. In the proof, the definition of \(A_i\) is unclear w.r.t. its further use. The equation (11) is under the assumptions made not valid. Four lines later, it is stated and used that the image of a closed convex set \(B\) of a vector function with convex coordinate functions is convex using the argumentation that it is the Cartesian product of the images of the coordinate functions. A simple example like \((x,y)\rightarrow (x^2+y^2,x+y): [0,1]^2\rightarrow \mathbb R^2\) shows that both are wrong. Thus the use of the separation theorem for the constructed convex sets remains open. For the second statement the authors use for a nonconvex vector function that the sum of the image of a closed convex set and that the usual open order cone is the Cartesian product of the sum of the images of the coordinate function and the set of positive reals, which is as wrong as the former statement. By the way they write that the sum of a closed convex set with open order cone is closed, but everybody knows that the union of open sets is open. Since the other theorems mainly use Theorem 3.1 it remains open whether they are true.
- scientific article; zbMATH DE number 7652678
- Multiobjective optimization problem with variational inequality constraints
- Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Optimality conditions for the semivectorial bilevel optimization problem
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Alternative theorems and optimality conditions with weakened convexity
- Coderivative Analysis of Quasi‐variational Inequalities with Applications to Stability and Optimization
- Convex Analysis
- Convexlike alternative theorems and mathematical programming
- Equilibrium problems with equilibrium constraints via multiobjective optimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- scientific article; zbMATH DE number 50640 (Why is no real title available?)
- Lagrange multiplier rules for approximate solutions in vector optimization
- Multiobjective optimization problem with variational inequality constraints
- Near-subconvexlikeness in vector optimization with set-valued functions
- On the Calmness of a Class of Multifunctions
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Variational Analysis
- Variational methods in partially ordered spaces
- Vector optimization. Set-valued and variational analysis.
- Multiobjective optimization problem with variational inequality constraints
- A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems
- scientific article; zbMATH DE number 6387627 (Why is no real title available?)
- scientific article; zbMATH DE number 6117320 (Why is no real title available?)
- Sensitivity analysis of multiobjective optimization problems with parameterized quasi-variational inequalities
- Optimality conditions for vector optimization problem governed by the cone constrained generalized equations
- scientific article; zbMATH DE number 7652678 (Why is no real title available?)
This page was built for publication: Optimality conditions for multiobjective optimization problem constrained by parameterized variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742188)
