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)
Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps. (English) Zbl 0893.90150
Summary: This paper establishes an alternative theorem for generalized inequality-equality systems of set-valued maps. Based on this, several (Lagrange) multiplier type as well as saddle point type necessary and sufficient conditions are obtained for the existence of weak minimizers in vector optimization of set-valued maps. Lagrange type duality theorems are also derived.

90C29Multi-objective programming; goal programming
90C48Programming in abstract spaces
Full Text: DOI
[1] Corley, H. W.: Existence and Lagrange duality for maximization of set-valued functions. J. optim. Theory appl. 54, 489-501 (1987) · Zbl 0595.90085
[2] Corley, H. W.: Optimality conditions for maximizations of set-valued functionism. J. optim. Theory appl. 58, 1-10 (1988) · Zbl 0956.90509
[3] Holmes, R. B.: Geometric functional analysis and its applications. (1975) · Zbl 0336.46001
[4] Jahn, J.: Mathematical vector optimization in partially-ordered linear spaces. (1986) · Zbl 0578.90048
[5] Li, Z. F.; Wang, S. Y.: Lagrangian multipliers and saddle points in multiobjective programming. J. optim. Theory appl. 83, 63-81 (1994) · Zbl 0823.90107
[6] Lin, L. J.: Optimization of set-valued functions. J. math. Anal. appl. 186, 30-51 (1994) · Zbl 0987.49011
[7] Luc, D. T.: Theory of vector optimization. Lecture notes in economics and mathematical system 319 (1989)
[8] Luc, D. T.; Malivert, C.: Invex optimization problems. Bull. austral. Math. soc. 46, 47-66 (1992) · Zbl 0755.90072
[9] Tamminen, E. V.: Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems. J. optim. Theory appl. 82, 93-104 (1994) · Zbl 0824.49032