Abstract

In this paper, a class of nonconvex nondifferentiable generalized minimax fractional programming problems is considered. Sufficient optimality conditions for the considered nondifferentiable generalized minimax fractional programming problem are established under the concept of (?, ?)-invexity. Further, two types of dual models are formulated and various duality theorems relating to the primal minimax fractional programming problem and dual problems are established. The results established in the paper generalize and extend several known results in the literature to a wider class of nondifferentiable minimax fractional programming problems. To the best of our knowledge, these results have not been established till now.

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

Similar Papers

Paper Title
Journal
Date
Author

More From: YUJOR

Paper Title
Journal
Date
Author

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.