Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.