Optimality conditions for multiobjective optimization problem constrained by parameterized variational inequalities
type: Item
instance of: scholarly article
title: Optimality conditions for multiobjective optimization problem constrained by parameterized variational inequalities
zbMATH Open document ID: 1306.65224
author: Li-Ping Pang
author: Fan-Yun Meng
author: Shuang Chen
author: Dan Li
published in: Set-Valued and Variational Analysis
publication date: 2014-09-18T00:00:00Z
review text: 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.
reviewed by: Armin Hoffmann
Mathematics Subject Classification ID: 65K15
Mathematics Subject Classification ID: 49J40
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6345537
zbMATH Keywords: parameterized variational inequalities
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: coderivative
zbMATH Keywords: Karush-Kuhn-Tucker for scalarization
zbMATH Keywords: calmness
describes a project that uses: MacMPEC
MaRDI profile type: Publication
full work available at URL: s11228-014-0277-4
OpenAlex ID: W2064865339
cites work: Vector optimization. Set-valued and variational analysis.
cites work: Q4000274
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Solving mathematical programs with complementarity constraints as nonlinear programs
cites work: Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
cites work: Variational methods in partially ordered spaces
cites work: On the Calmness of a Class of Multifunctions
cites work: Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
cites work: Convexlike alternative theorems and mathematical programming
cites work: A generalization of a minimax theorem of Fan via a theorem of the alternative
cites work: Lagrange multiplier rules for approximate solutions in vector optimization
cites work: Equilibrium problems with equilibrium constraints via multiobjective optimization
cites work: Coderivative Analysis of Quasi‐variational Inequalities with Applications to Stability and Optimization
cites work: Convex Analysis
cites work: Variational Analysis
cites work: Alternative theorems and optimality conditions with weakened convexity
cites work: Near-subconvexlikeness in vector optimization with set-valued functions
cites work: Multiobjective optimization problem with variational inequality constraints
DOI: 10.1007/S11228-014-0277-4
description: scientific article; zbMATH DE number 6345537