On sufficiency for discrete minmax fractional programming problems involving generalized (\theta,\eta,\rho)-V-univex functions

zbMATH Open1449.90334MaRDI QIDQ5226779FDOQ5226779

Publication date: 1 August 2019

Recommendations

Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized $(\theta,\eta,\rho)$-V-invex functions and arbitrary norms
Generalized $({\mathcal F},\beta,\varphi,\rho,\theta)$-univex functions and global parametric sufficient optimality conditions in semiinfinite discrete minmax fractional programming
A minimax fractional programming problem under a class of type I univexity
Generalized $(\eta,\rho)$-invex functions and global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing arbitrary norms
Generalized minimax fractional programming problems with generalized nonsmooth $(F,\alpha,\rho,d,\theta)$-univex functions

fractional programming minmax programming arbitrary norms parametric sufficient optimality conditions generalized $(\theta,\eta,\rho)-V$-univex functions

Mathematics Subject Classification ID

Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46) Minimax problems in mathematical programming (90C47)

Cited In (3)

This page was built for publication: On sufficiency for discrete minmax fractional programming problems involving generalized $(\theta,\eta,\rho)-V$-univex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226779)