𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Symmetric Duality for Multiobjective Variational Problems

✍ Scribed by T.R Gulati; I Husain; A Ahmed

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
232 KB
Volume
210
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

✦ Synopsis

A Mond᎐Weir type symmetric dual for a multiobjective variational problem is formulated. Weak and strong duality theorems under generalized convexity assumptions are proved for properly efficient solutions. Under an additional condition on the kernel function that occurs in the formulation of the problems, a self duality theorem is proved. A close relationship between these variational problems and symmetric dual nonlinear multiobjective programming problems is also incorporated.

πŸ“œ SIMILAR VOLUMES

Symmetric Duality for Multiobjective Var
Symmetric Duality for Multiobjective Variational Problems with Invexity
✍ Do Sang Kim; Won Jung Lee πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 176 KB

We formulate a pair of multiobjective nonlinear symmetric dual variational problems. For the single objective problems our problems become the symmetric Ε½ . dual pair of I. Smart and B.

Mixed Type Duality for Multiobjective Va
Mixed Type Duality for Multiobjective Variational Problems
✍ R.N Mukherjee; Ch.Purnachandra Rao πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 117 KB

The concept of mixed-type duality has been extended to the class of multiobjective variational problems. A number of duality relations are proved to relate the efficient solutions of the primal and its mixed-type dual problems. The results are Ε½ . obtained for -convex generalized -convex functions.

Duality for Multiobjective Variational P
Duality for Multiobjective Variational Problems with Invexity
✍ Chen XiuHong πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 192 KB

In this paper, Wolfe and Mond᎐Weir type duals for a class of nondifferentiable multiobjective variational problems are formulated. Under invexity assumptions on the objective and the constraint functions involved, weak and strong duality theorems are proved to related properly efficient solutions fo