Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms (Q874317)

The author studies the discrete minmax fractional programming problem \((P):\) Minimize \(\max_{1\leq i\leq p} \dfrac {f_i(x)+\parallel A_ix\parallel_{a(i)}} {g_i(x)-\parallel B_ix\parallel_{b(i)}}\) s.t. \(G_j(x)+\parallel C_j{x}\parallel_{c(j)} \leq 0, \;j\in \underline{q}, \;H_k(x) = 0, \;k \in \underline{r}, \;x\in X\) where \(X\) is an open convex subset of \(R^n, \;f_i, \;g_i, \;i\in \underline{p}\equiv(1,2, \ldots,p)\), \(G_j, \;j\in \underline{q} \;and \;H_k, \;k\in\underline{r}\) are real-valued functions defined on \(X\), for each \(i\in\underline{p}\) and each \(j\in\underline{q}, \;A_i, \;B_i, and \;C_j\) are respectively \(b_i\times n, \;m_i\times n \;and \;n_j\times n \;matrices, \;\parallel \cdot\parallel_{a(i)}, \;\parallel \cdot\parallel_{b(i)}, \;and \parallel \cdot\parallel_{c(j)}\) are arbitrary norms in \(R^{l_i}\), \(R^{m_i}\), and \(R^{n_i}\) respectively, and for each \(i\in\underline{p}\), \(g_i(x)-\parallel B_ix \parallel_{b(i)} >0\) for all \(x\) satisfying the constraints of (P). The principal result is the determination of twelve sets of generalized sufficiency results each of which is in fact a family of such results whose members, it is claimed, is to be identified by appropriate choices of certain sets and functions. These sufficiency results are obtained under generalized (\(\theta,\;\eta, \;\rho\))-V-invex assumptions. The author asserts that all these sufficiency results are applicable to ten classes of special versions of problems with fractional, discrete max, and conventional objective functions. The author concludes the paper with the remark that applicability of these results to the analysis of several duality models of (P) from the contents of a forthcoming paper.