GENERALIZED MINIMAX FRACTIONAL PROGRAMMING PROBLEMS WITH GENERALIZED NONSMOOTH $(F, ALPHA, RHO, D, THETA)$-UNIVEX FUNCTIONS
Keywords:
Generalized minimax fractional programming, (F,α,ρ,d,θ)-univexity, Sufficient optimality conditions, DualityAbstract
The aim of this paper is to establish the sufficient optimality conditions for a class of nondifferentiable multiobjective generalized minimax fractional programming problems involving univex functions. Subsequently, we apply the optimality condition to formulate a dual model and prove weak, strong and strict converse duality theorems.
Additional Files
Published
Issue
Section
License
Copyright (c) 2024 Journal of Nonlinear Analysis and Optimization: Theory & Applications (JNAO)
![Creative Commons License](http://i.creativecommons.org/l/by-nc-nd/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Copyright (c) 2010 Journal of Nonlinear Analysis and Optimization: Theory & Applications
This work is licensed under aย Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.