Constrained Vector-Valued Dynamic Game and Symmetric Duality for Multiobjective Variational Problems
نویسندگان
چکیده
A certain constrained vector-valued dynamic game is formulated and shown to be equivalent to a pair of multiobjective symmetric dual variational problems which have more general formulations than those studied earlier. A number of duality theorems, are established under suitable generalized convexity assumptions on the functionals. Selfduality reflecting symmetric dynamic games is investigated. The constrained vector-valued dynamic game is also regarded as equivalent to a pair of symmetric multiobjective dual variational problems with natural boundary conditions rather than fixed end points. Finally, it is indicated that our results can be considered as dynamic generalizations of those already existing in the literature. AMS-Mathematics Subject Classification: Primary 90C30, Secondary 90C11, 90C20, 90C26.
منابع مشابه
A note on symmetric duality in vector optimization problems
In this paper, we establish weak and strong duality theorems for a pair of multiobjective symmetric dual problems. This removes several omissions in the paper "Symmetric and self duality in vector optimization problem, Applied Mathematics and Computation 183 (2006) 1121-1126".
متن کاملPseudoconvex Multiobjective Continuous-time Problems and Vector Variational Inequalities
In this paper, the concept of pseudoconvexity and quasiconvexity for continuous~-time functions are studied and an equivalence condition for pseudoconvexity is obtained. Moreover, under pseudoconvexity assumptions, some relationships between Minty and Stampacchia vector variational inequalities and continuous-time programming problems are presented. Finally, some characterizations of the soluti...
متن کامل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.
متن کاملMinimax mixed integer symmetric duality for multiobjective variational problems
A Mond–Weir type multiobjective variational mixed integer symmetric dual program over arbitrary cones is formulated. Applying the separability and generalized F-convexity on the functions involved, weak, strong and converse duality theorems are established. Self duality theorem is proved. A close relationship between these variational problems and static symmetric dual minimax mixed integer mul...
متن کاملVariational Principles for Set-Valued Mappings with Applications to Multiobjective Optimization
This paper primarily concerns the study of general classes of constrained multiobjective optimization problems (including those described via set-valued and vector-valued cost mappings) from the viewpoint of modern variational analysis and generalized differentiation. To proceed, we first establish two variational principles for set-valued mappings, which—being certainly of independent interest...
متن کامل