[引用][C] Sufficiency and duality in multiobjective programming involving generalized F-convex functions
TR Gulati, MA Islam - Journal of Mathematical Analysis and Applications, 1994 - Elsevier
TR Gulati, MA Islam
Journal of Mathematical Analysis and Applications, 1994•Elsevier(P) Maximize f (x)=[f1 (x), f2 (x),..., fk (x)] subject to xeX={x: xeS, g (x) § 0, h (x)= 0}, where S is
a non-empty open convex subset of R" and f: S~+ R", g: S—> R'", and h: S—> R'are
differentiable functions at xeX, an efficient solution or a candidate for an efficient solution.
Notations. Throughout this paper we use the following notations. The index set K={1, 2,..., k},
L={1, 2,..., I}, and M:{l, 2,..., m}. For xeX, the index set I={ieM: g,(x)=()} and J={ieM: g,»(x)< 0}=
a non-empty open convex subset of R" and f: S~+ R", g: S—> R'", and h: S—> R'are
differentiable functions at xeX, an efficient solution or a candidate for an efficient solution.
Notations. Throughout this paper we use the following notations. The index set K={1, 2,..., k},
L={1, 2,..., I}, and M:{l, 2,..., m}. For xeX, the index set I={ieM: g,(x)=()} and J={ieM: g,»(x)< 0}=
(P) Maximize f (x)=[f1 (x), f2 (x),..., fk (x)] subject to xeX={x: xeS, g (x) § 0, h (x)= 0}, where S is a non-empty open convex subset of R" and f: S~+ R", g: S—> R’", and h: S—> R’are differentiable functions at xeX, an efficient solution or a candidate for an efficient solution. Notations. Throughout this paper we use the following notations. The index set K={1, 2,..., k}, L={1, 2,..., I}, and M:{l, 2,..., m}. For xeX, the index set I={ieM: g,(x)=()} and J={ieM: g,»(x)< 0}=
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果