首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Necessary and Sufficient Conditions for Efficiency Via Convexificators
Authors:Do Van Luu
Institution:1. Institute of Mathematics, Vietnam Academy of Science and Technology, 18 Hoang Quoc Viet Road, 10307, Hanoi, Vietnam
Abstract:Based on the extended Ljusternik Theorem by Jiménez-Novo, necessary conditions for weak Pareto minimum of multiobjective programming problems involving inequality, equality and set constraints in terms of convexificators are established. Under assumptions on generalized convexity, necessary conditions for weak Pareto minimum become sufficient conditions.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号