Multiobjective fractional programming problems involving (p,r)−ρ−(η,θ)-invex function

Higher order optimality and duality in fractional vector optimization over cones

“…(v) If we replace m by k, p by m and we take K = R k + and Q = R m + , then our problem (FP) reduces to the problem (FP) given by Jayswal et al [9] where X = R n .…”

“…Later in [7], for the class of multiobjective fractional programming problems, he gave efficiency conditions and duality results using the concept of (F, α, ρ, d )-convexity introduced in [6]. Antczak [8] gave a modified objective function method for solving nonlinear multiobjective fractional programming programs and Jayswal et al [9] established sufficient optimality conditions and duality results. The study of second and higher order duality is significant due to the computational advantage over the first order duality as it provides tighter bounds for the value of objective function when approximations are used because there are more parameters involved.…”

DUALITY IN MULTIOBJECTIVE FRACTIONAL PROGRAMMING PROBLEMS INVOLVING (Hp, r)-INVEX FUNCTIONS

“…Such problems are studied in various fields like economics [3], information theory [12], heat exchange networking [24] and others. Duality in multiobjective fractional programming problems involving generalized convex functions have been of much interest in recent past, (see [4,5,8,14,16,18,22]) and the references cited therein. For more information about fractional programming problems, the reader may consult the research bibliography compiled by Stancu-Minasian [19,20,21].…”

“…Recently, Jayswal et al [8] focus his study on multiobjective fractional programming problems and derived sufficient optimality conditions and duality theorems involving (p, r) − ρ − (η, θ)-invex functions [11].…”

G-semipreinvexity and its applications

“…There have been many attempts to weaken the convexity assumptions to treat many practical problems. Therefore, many concepts of generalized convex functions have been introduced and applied to mathematical programming problems in the literature [1,2,10,[12][13][14][15][16][17][18][19][20][21]23,24,[26][27][28][29][30][31][32][33][34]. One of these concepts, invexity, was introduced by Hanson in [17].…”