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

B-(p,r)-不变凸规划问题的最优性讨论
引用本文:孙玉华,张艳.B-(p,r)-不变凸规划问题的最优性讨论[J].辽宁师范大学学报(自然科学版),2005,28(2):139-142.
作者姓名:孙玉华  张艳
作者单位:北京科技大学,数力系,北京,100083;北京建工学院,基础部,北京,100044
摘    要:B-(p,r)-不变凸函数是一类新的广义凸函数,它既是不变B凸函数又是(p,r)-不变凸函数的推广形式,从而是熟知的凸函数和不变凸函数的推广形式.这篇文章利用B-(p,r)-不变凸函数讨论了目标函数和约束函数均可微的多目标规划问题,证明了目标函数和约束函数在B-(p,r)-不变凸函数限制下可行解为有效解的几个最优性充分条件,其结论具有一般性,推广了许多涉及不变凸函数、不变B-凸函数和(p,r)-不变凸函数的文献的结论.

关 键 词:多目标规划  B-(p  r)-不变凸函数  最优性条件  有效解
文章编号:1000-1735(2005)02-0139-04
修稿时间:2004年11月28

Optimality Discussions for Programming Problems with B-(p,r)-Invexity Functions
SUN Yu-hua,ZHANG Yan.Optimality Discussions for Programming Problems with B-(p,r)-Invexity Functions[J].Journal of Liaoning Normal University(Natural Science Edition),2005,28(2):139-142.
Authors:SUN Yu-hua  ZHANG Yan
Institution:SUN Yu-hua~1,ZHANG Yan~2
Abstract:B-(p,r)-invexity functions are new generalized invex functions. It is generalization of the B-invexity functions and (p,r)-invexity functions, thus it is the generalization of well known invex functions and invexity functions. By using B-(p,r)-invexity functions, the multiobjective programming problems are considered, in which the objective and the constraint functions are differentiable. The sufficient optimality conditions for an efficient solution are established, under B-(p,r)-invexity assumptions on objective and the constraint functions. The work generalizes many results on programming problems with invex functions, B-invexity functions and (p,r)-invexity functions.
Keywords:multiobjective programming  B-(p  r)-invexity functions  optimality conditions  efficient solution
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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