Abstract
The concept of invexity has allowed the convexity requirements in a variety of mathematical programming problems to be weakened. We extend a number of Kuhn-Tucker type sufficient optimality criteria for a class of continuous nondifferentiable minmax fractional programming problems that involves several ratios in the objective with a nondifferentiable term in the numerators. As an application of these optimality results, various Mond-Weir type duality results are proved under a variety of generalized invexity assumptions. These results extend many well-known duality results and also give a dynamic generalization of those of finite dimensional nonlinear programming problems recently explored.
Sign-in/Register to access full text options 
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.
