Symmetric duality for Bonvex multiobjective fractional continuous time programming problems
نویسندگان
چکیده
منابع مشابه
Symmetric duality for multiobjective fractional variational problems with generalized invexity
The concept of symmetric duality for multiobjective fractional problems has been extended to the class of multiobjective variational problems. Weak, strong and converse duality theorems are proved under generalized invexity assumptions. A close relationship between these problems and multiobjective fractional symmetric dual problems is also presented. 2005 Elsevier Inc. All rights reserved.
متن کاملSymmetric duality for multiobjective fractional variational problems involving cones
In this paper, a pair of multiobjective fractional variational symmetric dual problems over cones is formulated. Weak, strong and converse duality theorems are established under generalized F-convexity assumptions. Moreover, self duality theorem is also discussed. 2007 Elsevier B.V. All rights reserved.
متن کاملHigher-order symmetric duality for a class of multiobjective fractional programming problems
Correspondence: gaoyingimu@163. com Department of Mathematics, Chongqing Normal University, Chongqing 400047, China Abstract In this paper, a pair of nondifferentiable multiobjective fractional programming problems is formulated. For a differentiable function, we introduce the definition of higher-order (F, a, r, d)-convexity, which extends some kinds of generalized convexity, such as second or...
متن کاملBenson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملDuality for multiobjective fractional programming problem using convexifactors
In this paper, the concept of ∂-quasiconvexity is introduced by using convexifactors. Mond-Weir-type and Schaible-type duals are associated with a multiobjective fractional programming problem, and various duality results are established under the assumptions of ∂-pseudoconvexity and ∂-quasiconvexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Material Science Research India
سال: 2010
ISSN: 0973-3469,2394-0565
DOI: 10.13005/msri/070211