GENERALIZED MINIMAX FRACTIONAL PROGRAMMING PROBLEMS WITH GENERALIZED NONSMOOTH $(F, ALPHA, RHO, D, THETA)$-UNIVEX FUNCTIONS
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.
How to Cite
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.