Abstract
In this article, we focus our study on a nondifferentiable minimax fractional programming problem and establish weak, strong and strict converse duality theorems under generalized higher order (F, α, p, d)-Type I assumptions. Our results extend and unify some of the known results in the literature.
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 callDisclaimer: 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.
