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
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
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.
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