Generalized \(\alpha\)-invexity and nondifferentiable minimax fractional programming (Q2370571): Difference between revisions

\textit{M. A. Noor} [JIPAM, J. Inequal. Pure Appl. Math. 5, No.~4, Paper No.~110, 9 p., electronic only (2004; Zbl 1094.26008] introduced the notion of \(\alpha\)-invex sets and preinvex functions as follows. Let \(X\) be a nonempty subset of \(\mathbb{R}^n\), \(\eta:X\times X\to\mathbb{R}^n\) a vector-valued function and \(\alpha(x,u):X\times X\to\mathbb{R}_+ \setminus\{0\}\) a bifurcation. A subset of \(X\) is called \(\alpha\)-invex set if there exist \(\eta:X\times X\to \mathbb{R}^n\), \(\alpha(x,a):X\times X\to\mathbb{R}_+\) such that for all \(x\in X\), \[ u+k\alpha(x,a)\eta(x,a)\to X \] for all \(x\), \(a\in X\), \(k \in[0,1]\). The function \(f\) defined on an \(\alpha\)-invex set is said to be \(\alpha\)-preinvex function if there exist \(\eta\) and \(\alpha\) such that for all \(x\in X\), \[ f(u+k\alpha(x,a)\eta(x,a))\leq(1-k)f(a)+kf(x) \] for all \(x\), \(a\in X\), \(k\in[0,1]\). The authors now define strict pseudo-\(\alpha\)-invex and quasi-\(\alpha\)-invex functions, and derive Kuhn-Tucker type sufficient optimality conditions, and establish duality theorems for a nondifferentiable minimax fractional programming problem. The results extend several known theorems in the literature.