# 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)
Optimality criteria in mathematical programming involving generalized invexity. (English) Zbl 0647.90076
Constrained optimization problems of the form (1) minimize f(x) subject to $x\in X\subseteq R\sp n$, g(x)$\le 0$, with differentiable functions f, g f type I or type II are considered: The functions f, g are called of type I with respect to a vector function $\eta$ (x) at $x\sb 0$ if the relations $$f(x)-f(x\sb 0)\ge [\nabla\sb xf(x\sb o)]' \eta (x),\quad - g(x\sb 0)\ge [\nabla\sb xg(x\sb o)] \eta (x)$$ hold for all feasible x of the problem (1). Similarly f, g are called of type II with respect to x at $x\sb 0$, if $$f(x\sb 0)-f(x)\ge [\nabla\sb xf(x)]' \eta (x),\quad and\quad -g(x)\ge \nabla\sb xg(x) \eta (x)$$ are satisfied for all feasible solutions of the problem (1). Various sufficient conditions, under which the functions f, g are of type I or II are given. Sufficient optimality conditions for the problem (1), in which f, g are of type I or II are proved.
Reviewer: K.Zimmermann

##### MSC:
 90C30 Nonlinear programming 49K05 Free problems in one independent variable (optimality conditions)
##### Keywords:
Sufficient optimality conditions
Full Text:
##### References:
 [1] A. Ben-Israel and B. Mond, What is invexity? unpublished, Department of Mathematics, La Trobe University, Bundoora, Victoria, 3083, Australia. [2] Hanson, M. A.: On sufficiency of the Kuhn-Tucker conditions. J. math. Anal. appl. 80, 545-550 (1981) · Zbl 0463.90080 [3] Hanson, M. A.; Mond, B.: Necessary and sufficient conditions in constrained optimization. FSU statistics report M 683 (1984) · Zbl 0622.49005 [4] Kaul, R. N.; Kaur, S.: Optimality criteria in nonlinear programming involving non-convex functions. J. math. Anal. appl. 105, 104-112 (1985) · Zbl 0553.90086