Nondifferentiable multiobjective symmetric dual programs over cones
β Scribed by T.R. Gulati; Geeta; S.K. Gupta
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 226 KB
- Volume
- 74
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π 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.
In this work, we establish a strong duality theorem for Mond-Weir type multiobjective higher-order nondifferentiable symmetric dual programs. This fills some gaps in the work of Chen [X. Chen, Higher-order symmetric duality in nondifferentiable multiobjective programming problems, J. Math. Anal. App
A pair of Mond-Weir type multi-objective higher order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under higher order K -F -convexity assumptions. Our results generalize several known results in the literature.