B-(p,r)-不变凸规划问题的鞍点最优性条件  

Saddle Point Optimality Conditions for Programming Problems with B-(p,r)-invexity Functions

作　　者：焦合华[1] 

机构地区：[1]长江师范学院数学系,重庆涪陵408003

出　　处：《河北师范大学学报（自然科学版）》2008年第3期305-309,共5页Journal of Hebei Normal University：Natural Science

基　　金：国家自然科学基金(10171118);重庆市教育厅科学技术研究基金(KJ051307;KJ041302)

摘　　要：B-(p,r)-不变凸函数是一类新的广义凸函数,它既是不变B-凸函数又是(p,r)-不变凸函数的推广形式,从而也是熟知的凸函数和不变凸函数的推广形式.首先介绍了一个广义Lagrange向量函数L(x,u),并利用B-(p,r)-不变凸函数讨论了多目标分式规划问题的鞍点最优性条件,其结果具有一般性,推广了许多涉及不变凸函数、不变B-凸函数和(p,r)-不变凸函数的文献的结论.B-（ p, r）-invexity functions are new generalized invex functions. It is the generalization of the B- invexity functions and（p, r）-invexity functions, thus it is also the generalization of well known convexity functions and invexity functions. A vector valued Lagrangian L （ x, u ） is introduced firstly, and by using B- （ p, r）- invexity functions, the saddle point optimality conditions of a multiobjective fractional programming problem are established. The work generalizes many results on programming problems with invex functions, B-invexity functions and （p, r）-invexity functions.

关 键 词：多目标分式规划 B-(p r)-不变凸函数 鞍点 最优性条件 

分 类 号：O221.6[理学—运筹学与控制论]