On sufficiency for discrete minmax fractional programming problems involving generalized (\theta,\eta,\rho)-V-univex functions
From MaRDI portal
Publication:5226779
Recommendations
- Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized (,,)-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
Cited in
(3)- On Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Under Generalized V-Invexity
- Generalized \(({\mathcal F},\beta,\varphi,\rho,\theta)\)-univex functions and global parametric sufficient optimality conditions in semiinfinite discrete minmax fractional programming
- Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms
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)