Abstract
In this paper, a generalization of convexity is considered in the case of nonlinear multiobjective programming problem where the functions involved are nondifferentiable. By considering the concept of Pareto optimal solution and substituting d-invexity for convexity, the Fritz John type and Karush–Kuhn–Tucker type necessary optimality conditions and duality in the sense of Mond–Weir and Wolfe for nondifferentiable multiobjective programming are given.
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.
