# zbMATH — the first resource for mathematics

##### Examples
 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.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 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)
Convex and nonsmooth problems of vector optimization. (Vypuklye i negladkie zadachi vektornoj optimizatsii.) (Russian) Zbl 0765.90079
Minsk: Navuka i Tekhnika. 240 p. (1990).
Two main topics of vector optimization are treated in this monograph: scalarization of convex problems and optimality conditions for nonsmooth problems. The material is arranged in an introduction and 5 chapters: 1) Sublinear preorder relations; 2) Scalarization of convex vector optimization problems; 3) Approximate quasidifferentiability of real- valued functions and optimality conditions in scalar optimization; 4) Approximate quasidifferentiability of vector-valued functions and optimality conditions in vector optimization; 5) Necessary optimality conditions for control problems with terminal vector objectives. In the first chapter, preliminary concepts of binary relations are introduced; sublinear preorder relations are analyzed together with dual objects, the so-called corteges of linear functionals. In Chapter 2, two scalarization approaches are developed for convex vector problems: the first one is standard which uses linear functionals; the second one is nonconventional, which uses corteges (families of linear functionals) instead. Chapter 3 is devoted to the presentation of quasidifferential and $\varepsilon$-quasidifferential of real-valued functions and their applications in deriving optimality conditions for nonsmooth scalar problems. All this is then extended to the case of vector-valued functions in Chapter 4 in order to establish optimality conditions for vector problems. In the last chapter, optimal control problems with terminal vector objectives are tackled by using again quasidifferentials and $\varepsilon$-quasidifferentials. The book contains the author’s deep investigations on optimality conditions in vector optimization via quasidifferentials. It is a valuable source for all researchers in the field of vector and nonsmooth optimization.

##### MSC:
 90C29 Multi-objective programming; goal programming 49J52 Nonsmooth analysis (other weak concepts of optimality) 90-01 Textbooks (optimization)