×

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^ n\), g(x)\(\leq 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_ 0\) if the relations \[ f(x)-f(x_ 0)\geq [\nabla_ xf(x_ o)]' \eta (x),\quad - g(x_ 0)\geq [\nabla_ xg(x_ 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_ 0\), if \[ f(x_ 0)-f(x)\geq [\nabla_ xf(x)]' \eta (x),\quad and\quad -g(x)\geq \nabla_ 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 Optimality conditions for free problems in one independent variable
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] {\scA. Ben-Israel and B. Mond}, What is invexity? unpublished, Department of Mathematics, La Trobe University, Bundoora, Victoria, 3083, Australia. · Zbl 0603.90119
[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, () · 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
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.