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

Unified higher order duality in nondifferentiable multiobjective programming involving cones

โœ Scribed by Izhar Ahmad

Book ID
113796579
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
218 KB
Volume
55
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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

Higher order symmetric duality in nondif
Higher order symmetric duality in nondifferentiable multi-objective programming problems involving generalized cone convex functions
โœ Ravi P. Agarwal; Izhar Ahmad; Anurag Jayswal ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 281 KB

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.