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)
Degrees of efficiency and degrees of minimality. (English) Zbl 1046.90084
Summary: We characterize different types of solutions of a vector optimization problem by means of a scalarization procedure. Usually different scalarizing functions are used in order to obtain the various solutions of the vector problem. Here we consider different kinds of solutions of the same scalarized problem. Our results allow us to establish a parallelism between the solutions of the scalarized problem and the various efficient frontiers: stronger solution concepts of the scalar problem correspond to more restrictive notions of efficiency. Besides the usual notions of weakly efficient and efficient points, which are characterized as global and strict global solutions of the scalarized problem, we also consider some restricted notions of efficiency, such as strict and proper efficiency, which are characterized as Tikhonov well-posed minima and sharp minima for the scalarized problem.

90C29Multi-objective programming; goal programming
90C31Sensitivity, stability, parametric optimization
90C48Programming in abstract spaces
49K40Sensitivity, stability, well-posedness of optimal solutions
Full Text: DOI