𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nondifferentiable higher order duality in multiobjective programming involving cones

✍ Scribed by Do Sang Kim; Yu Jung Lee

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
283 KB
Volume
71
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

✦ Synopsis

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 duality theorems for an efficient solution under suitable higher order generalized invexity conditions. As special cases of our duality relations, we give some known duality results.

πŸ“œ SIMILAR VOLUMES

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.

Second-order duality in nondifferentiabl
Second-order duality in nondifferentiable minmax programming involving type-I functions
✍ I. Ahmad; Z. Husain; Sarita Sharma πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 199 KB

Two types of second-order dual models are formulated for a nondifferentiable minmax programming problem and usual duality results are established involving generalized type-I functions.

Mond–Weir type second-order symmetric du
Mond–Weir type second-order symmetric duality in multiobjective programming over cones
✍ T.R. Gulati; Geeta πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 386 KB

A pair of Mond-Weir type second-order symmetric dual multiobjective programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under pseudoinvexity/K -F -convexity assumptions.