Abstract
Set-valued optimization is known as a useful mathematical model for investigating some real world problems with conflicting objectives, arising from economics, engineering and human decision-making. Using an extremal principle introduced by Mordukhovich, we establish optimality conditions for D.C. ( difference of convex ) set-valued optimization problems. An application to vector fractional mathematical programming is also given.
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.
