Abstract
In this paper, we present new class of higher-order \((C, \alpha , \rho , d)\)-convexity and formulate two types of higher-order duality for a nondifferentiable minimax fractional programming problem. Based on the higher-order \((C, \alpha , \rho , d)\)-convexity, we establish appropriate higher-order duality results. These results extend several known results to a wider class of programs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.