We formulate a pair of multiobjective symmetric dual programs for pseudo-invex functions and arbitrary cones. Our model is unifying the Wolfe vector symmetric dual and the Mond-Weir vector symmetric dual models. We establish the weak, strong, converse and self duality theorems for our pair of dual m
Multiobjective mixed symmetric duality involving cones
β Scribed by I. Ahmad; Z. Husain
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 527 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
A pair of multiobjective mixed symmetric dual programs is formulated over arbitrary cones. Weak, strong, converse and self-duality theorems are proved for these programs under K -preinvexity and K -pseudoinvexity assumptions. This mixed symmetric dual formulation unifies the symmetric dual formulations of Suneja et al.
π SIMILAR VOLUMES
We introduce the nondifferentiable multiobjective problem involving cone constraints, where every component of the objective function contains a term involving the support function of a compact convex set. For this problem, Wolfe and Mond-Weir type duals are proposed. We establish weak, strong duali
A pair of Mond-Weir type second-order symmetric dual multiobjective programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under pseudoinvexity/K -F -convexity assumptions.
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
Wolfe and Mond-Weir type nondifferentiable multiobjective symmetric dual programs are formulated over arbitrary cones and appropriate duality theorems are established under K -preinvexity/K -convexity/pseudoinvexity assumptions.