zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Scalarization and optimality conditions for vector equilibrium problems. (English) Zbl 1197.49011
Summary: We investigate vector equilibrium problems and give scalarization results for weakly efficient solutions, Henig efficient solutions, and globally efficient solutions to the vector equilibrium problems without the convexity assumption. Using nonsmooth analysis and the scalarization results, we provide necessary conditions for weakly efficient solutions, Henig efficient solutions, globally efficient solutions, and superefficient solutions to vector equilibrium problems. By the assumption of convexity, we give sufficient conditions for those solutions. As applications, necessary and sufficient conditions for corresponding solutions to vector variational inequalities and vector optimization problems are provided.
49J52Nonsmooth analysis (other weak concepts of optimality)
49J50Fréchet and Gateaux differentiability
90C29Multi-objective programming; goal programming
90C46Optimality conditions, duality
49K27Optimal control problems in abstract spaces (optimality conditions)
49N15Duality theory (optimization)