๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Higher-order -convexity and symmetric duality in multiobjective programming

โœ Scribed by S.K. Gupta; N. Kailey; M.K. Sharma

Book ID
108078595
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
254 KB
Volume
60
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Second-order symmetric duality in multio
Second-order symmetric duality in multiobjective programming
โœ Xin-Min Yang; Shui-Hung Hou ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 354 KB

## 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 note on higher-order nondifferentiable
A note on higher-order nondifferentiable symmetric duality in multiobjective programming
โœ Ravi P. Agarwal; Izhar Ahmad; S.K. Gupta ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 206 KB

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

Nondifferentiable higher order duality i
Nondifferentiable higher order duality in multiobjective programming involving cones
โœ Do Sang Kim; Yu Jung Lee ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 283 KB

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