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

Higher-order duality for nondifferentiable minimax programming problem with generalized convexity

โœ Scribed by Anurag Jayswal; Ioan Stancu-Minasian

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
240 KB
Volume
74
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.