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)
On multiple-objective optimization with generalized univexity. (English) Zbl 0911.90292
Summary: A multiple-objective optimization problem involving generalized univex functions is considered. Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point to be an efficient or properly efficient solution. Mond-Weir type duality results are obtained. Further, a vector-valued Lagrangian is introduced and certain vector saddlepoint results are presented. $\copyright$ 1998 Academic Press.

90C29Multi-objective programming; goal programming
26B25Convexity and generalizations (several real variables)
Full Text: DOI
[1] Bector, C. R.; Singh, C.: B-vex functions. J. optim. Theory appl. 71, 237-253 (1991) · Zbl 0793.90069
[2] Bector, C. R.; Suneja, S. K.; Gupta, S.: Univex functions and univex nonlinear programming. (1992) · Zbl 0802.90092
[3] Bector, C. R.; Suneja, S. K.; Lalitha, C. S.: Generalizedbb. (1991)
[4] Geoffrion, A. M.: Proper efficiency and theory of vector maximization. J. math. Anal. appl. 22, 618-630 (1968) · Zbl 0181.22806
[5] Hanson, M. A.; Mond, B.: Necessary and sufficient conditions in constrained optimization. Math. programming 37, 51-58 (1987) · Zbl 0622.49005
[6] Kaul, R. N.; Suneja, S. K.; Srivastava, M. K.: Optimality criteria and duality in multiple-objective optimization involving generalized invexity. J. optim. Theory appl. 80, 465-482 (1994) · Zbl 0797.90082
[7] Rueda, N. G.; Hanson, M. A.: Optimality criteria in mathematical programming involving generalized invexity. J. math. Anal. appl. 130, 375-385 (1988) · Zbl 0647.90076
[8] Rueda, N. G.; Hanson, M. A.; Singh, C.: Optimality and duality with generalized convexity. J. optim. Theory appl. 86, 491-500 (1995) · Zbl 0838.90114
[9] Weir, T.: A note on invex functions and duality in multiple-objective optimization. Opsearch 25, 98-104 (1988) · Zbl 0655.90077