Abstract
Optimality conditions for multi objective programming problems have been studied extensively in the literature. A necessary condition for Pareto optimality is derived by reducing the multi objective programming under inclusion constraints to systems of single objective problem and then using known results of them. The result is reasonable and efficient. Our aim in this paper is to get the optimality condition of problem (MOP) by a lemma which helps reducing multi objective optimality problem to systems of single objective ones.
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.
