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

一类多目标广义凸规划问题的最优性条件
引用本文:包福利,于宪伟,肖宏伟.一类多目标广义凸规划问题的最优性条件[J].渤海大学学报(自然科学版),2006,27(4):340-343.
作者姓名:包福利  于宪伟  肖宏伟
作者单位:渤海大学,数学系,辽宁,锦州,121013
摘    要:B-半预凸函数是一类新的广义凸函数,它既是B-凸函数、B-预凸函数又是半预凸函数的推广形式,即为熟知的凸函数的推广。讨论了目标数和约束数均为B-半预凸函数且连续可微时的多目标规划问题,在B-半预凸函数的限制下得出了多目标规划问题的可行解为其有效解的最优充分条件。

关 键 词:多目标规划  B-半预凸函数  最优性条件  有效解
文章编号:1673-0569(2006)04-340-04
收稿时间:04 10 2006 12:00AM
修稿时间:2006年4月10日

Optimization condition for a class of multi—objective generalization convex programming
BAO Fu-li,YU Xian-wei,XIAO Hong-wei.Optimization condition for a class of multi—objective generalization convex programming[J].Journal of Bohai University:Natural Science Edition,2006,27(4):340-343.
Authors:BAO Fu-li  YU Xian-wei  XIAO Hong-wei
Institution:Department of Mathematics, Bohai University, Jinzhou 121013, China
Abstract:B-semiprenvex function is a new class of generalization convex function,and it is both the generalization form of B-convex function,B-preinvex function, and of semipreinvex function, i. e. the generalization of convex function. When the objective function and constrain function are equal to B-semipreinvex function, and are continuous and differential, the multi-objective programming is discussed, and its feasible solution is its effcient and sufficient optimization condition under the restrikction of B-semipreinvex function.
Keywords:multi-objective programming  B-semipreinvex function  optimization condition efficient solution
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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