DocumentCode
2985885
Title
Optimality Conditions for Fractional Programming with B (p, r, a) Invex Functions
Author
Li, XiangYou ; Zhang, QingXiang
Author_Institution
Coll. of Math. & Comput. Sci., Yanan Univ., Yanan, China
fYear
2011
fDate
3-4 Dec. 2011
Firstpage
115
Lastpage
118
Abstract
In this paper, new classes of generalized invex functions called B - (p, r, a)-invex, B - (p, r, a)-quasi invex and B - (p, r, a)-pseudo invex functions are introduced, which are defined by relaxing the definitions of B - (p, r)-invex, B - (p, r)-quasi-invex, B - (p, r)-pseudo-invex functions, then generalized minimax fractional programming involving such functions is reseached, the sufficient conditions for optimality are obtained under weeker convexity.
Keywords
mathematical programming; minimax techniques; B-(p, r, a) invex functions; B-(p, r, a) pseudo invex functions; B-(p, r, a) quasi invex functions; fractional programming; minimax fractional programming; optimality conditions; weeker convexity; Educational institutions; Electronic mail; Mathematical programming; Programming; Security; Single photon emission computed tomography; (p; B − a)-invex function; a)-pseudo-invex function; a)-quasi-invex function; fractional programming; optimality condition; r;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Security (CIS), 2011 Seventh International Conference on
Conference_Location
Hainan
Print_ISBN
978-1-4577-2008-6
Type
conf
DOI
10.1109/CIS.2011.33
Filename
6128086
Link To Document