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
Duality for a Class of Minmax and Inexact Programming Problem
β Scribed by C.R. Bector; S. Chandra; V. Kumar
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 344 KB
- Volume
- 186
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A sufficient optimality theorem is proved for a certain minmax programming Ε½ . problem under the assumptions of proper b, -invexity conditions on the functions involved in the objective and in the constraints. Next a dual is presented for such a problem and duality theorems relating the primal and t
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.
Both parametric and nonparametric necessary and sufficient optimality conditions are established for a class of nonsmooth constrained optimal control problems with fractional objective functions and linear dynamics. Moreover, using the forms and contents of these optimality principles, four parametr