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)
Computing compromise solutions: On the connections between compromise programming and composite programming. (English) Zbl 1169.90440
Summary: This paper analyzes the relationship between Compromise Programming and a close relative called Composite Programming that is based on the use of composite metrics. More specifically, it focuses on the possibility that the results of Compromise Programming are equivalent to those obtained with a particular case of Composite Programming in which a linear combination between the two bounds of the compromise set is established. Several situations, depending on the number of criteria involved and the mathematical structure of the efficient set, are studied. The most relevant result is obtained when two criteria are involved and the efficient boundary is defined by a continuously differentiable and strictly quasi-convex function. In this case, it is possible to find a unique equivalent value of the control parameter in Composite Programming for each metric in Compromise Programming. It is remarked that this particular case is very relevant in many economic scenarios. On the other hand, it turns out that the equivalence between both approaches cannot be extended to the case with more than two criteria.
MSC:
90C29Multi-objective programming; goal programming