𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Duality for a Class of Nondifferentiable Multiobjective Programming Problems

✍ Scribed by Xin Min Yang; Kok Lay Teo; Xiao Qi Yang


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
64 KB
Volume
252
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

✦ Synopsis


In this paper, both the Wolfe type and Mond᎐Weir type dual problems for a class of nondifferentiable multiobjective programs in which every component of the objective function contains a term involving the support function of a compact convex set are formulated. Weak duality theorems are established under suitable conditions. A special case which appears repeatedly in the literature is that the support function is the square root of a positive semidefinite quadratic form. This and other special cases can be readily generated from our results.


πŸ“œ SIMILAR VOLUMES


Duality for a Class of Multiobjective Co
✍ Chen Xiuhong πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 135 KB

In this paper, a class of multiobjective control problems is considered, where the objective and constraint functions involved are f t x t αΊ‹ t y t z t with x t ∈ R n , y t ∈ R n , and z t ∈ R m , where x t and z t are the control variables and y t is the state variable. Under the assumption of invex

Duality for a Class of Multiobjective Co
✍ Liang Zhian; Ye Qingkai πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 126 KB

defined another kind of invexity, corresponding generalized invexity, and discussed the duality for multiobjective control problems with such generalized invexity. In this paper, the duality results for multiobjective control problems with Mond and Smart's generalized invexity are discussed.

Symmetric Duality for Multiobjective Var
✍ T.R Gulati; I Husain; A Ahmed πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 232 KB

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 pro