In this paper, by making use of some advanced tools from variational analysis and generalized differentiation, we establish necessary optimality conditions for a class of robust fractional minimax programming problems. Sufficient optimality conditions for the considered problem are also obtained by means of generalized convex functions. Additionally, we formulate a dual problem to the primal one and examine duality relations between them. In our results, by using the obtained results, we obtain necessary and sufficient optimality conditions for a class of robust fractional multi-objective optimization problems.
No takes yet. Share an insight, caveat, or question.
Li et al. (2024) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: