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 note on higher-order nondifferentiable symmetric duality in multiobjective programming
β Scribed by Ravi P. Agarwal; Izhar Ahmad; S.K. Gupta
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 206 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
β¦ Synopsis
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. Appl. 290 (2004) 423-435].
π SIMILAR VOLUMES
This article is concerned with a pair of second-order symmetric dual non-differentiable programs and second-order F-pseudo-convexity. We establish the weak and the strong duality theorems for the new pair of dual models under the F-pseudo-convexity assumption. Several known results including Mond an
## pair of second-order symmetric dual models for multiobJective nonlinear programmmg 1s proposed m this paper We prove the weak, strong, and converse duality theorems for the formulated second-order symmetric dual programs under mvexity condltlons
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.
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.