## 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
Lexicographical order and duality in multiobjective programming
โ Scribed by Juan Enrique Martinez-Legaz
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 450 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
๐ 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
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