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.
Symmetric dual multiobjective programming
โ Scribed by L.N. Das; S. Nanda
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 383 KB
- Volume
- 97
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## 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
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
We propose a framework for developing and analyzing primal-dual interior point algorithms for semidefinite programming. This framework is an extension of the v-space approach that was developed by Kojima et al. (1991) for linear complementarity problems. The extension to semidefinite programming all