We consider some types of generalized convexity and discuss new global semiparametric sufficient efficiency conditions for a multiobjective fractional programming problem involving n-set functions.
We consider some types of generalized convexity and discuss new global semiparametric sufficient efficiency conditions for a multiobjective fractional programming problem involving n-set functions.
We consider some types of generalized convexity and discuss duality results for a fractional programming problem involving (F, b, phi, rho, theta)-univex n-set functions. Almost all results presented until now in the ...
详细信息
We consider some types of generalized convexity and discuss duality results for a fractional programming problem involving (F, b, phi, rho, theta)-univex n-set functions. Almost all results presented until now in the literature were obtained under the assumption that the function F is sublinear or, in the last time, convex in the third argument. In our approach, we suppose that F is a quasiconvex function in the third argument. (C) 2011 Elsevier Ltd. All rights reserved.
In this paper, we introduce new concepts of epsilon-weak efficient solutions and epsilon-efficient solutions for a nonconvex multiobjective fractional programming problem involving n-set functions. Using an epsilon-pa...
详细信息
In this paper, we introduce new concepts of epsilon-weak efficient solutions and epsilon-efficient solutions for a nonconvex multiobjective fractional programming problem involving n-set functions. Using an epsilon-parametric approach and a new theorem of alternative for nonconvex n-set functions, some necessary and sufficient conditions for epsilon-approximate solutions are derived.
We present a method of obtaining some classes of generalized V-univex type-I multiobjective optimization problems starting from classes of problems involving functions defined on R". In this way, examples of mult...
详细信息
ISBN:
(纸本)9789955282839
We present a method of obtaining some classes of generalized V-univex type-I multiobjective optimization problems starting from classes of problems involving functions defined on R". In this way, examples of multiobjective optimization problems given in previous articles, which are mentioned in the references, can be reformulated as optimization problems with generalized vectorial functions and having the same properties as the original ones.
A new concept of nondominated approximate weak efficient solution to a multiobjective n-set optimization problem is introduced. Saddle point theorems are presented. These theorems are then used to characterize the app...
详细信息
A new concept of nondominated approximate weak efficient solution to a multiobjective n-set optimization problem is introduced. Saddle point theorems are presented. These theorems are then used to characterize the approximate solutions for the primal-dual pair of problems.
We consider some types of generalized convexity and discuss new global semiparametric sufficient efficiency conditions for a multiobjective fractional programming problem involving n-set functions.
We consider some types of generalized convexity and discuss new global semiparametric sufficient efficiency conditions for a multiobjective fractional programming problem involving n-set functions.
暂无评论