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.
Mixed Type Duality in Multiobjective Programming Problems
β Scribed by Zengkun Xu
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 162 KB
- Volume
- 198
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
An incomplete Lagrange function is introduced for a class of nonlinear programming problems which explains the reason behind the construction of the MondαWeirαtype dual. A mixed-type dual is presented for a class of fractional and generalized fractional programming problems, and various duality theo