Abstract
In this paper, a nonconvex nonsmooth multiobjective programming problem is considered and two its higher-order duals are defined. Further, several duality results are established between the considered nonsmooth vector optimization problem and its dual models under assumptions that the involved functions are higher-order (??)-type I functions.
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.
