✦ LIBER ✦

Higher-order symmetric duality with cone constraints

✍ Scribed by T.R. Gulati; S.K. Gupta

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 430 KB
Volume: 22
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2008.08.017

No coin nor oath required. For personal study only.

✦ Synopsis

A pair of higher-order Wolfe and Mond-Weir type symmetric dual models with cone constraints are formulated and usual duality theorems are established under higher-order η-invexity/η-pseudoinvexity assumptions. Symmetric minimax mixed integer primal and dual problems are also discussed. These duality relations also remove certain inconsistencies in some of the earlier results.

📜 SIMILAR VOLUMES

Second-order symmetric duality with cone

Second-order symmetric duality with cone constraints

✍ T.R. Gulati; S.K. Gupta; I. Ahmad 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Wolfe and Mond-Weir type second-order symmetric duals are formulated and appropriate duality theorems are established under -bonvexity/ -pseudobonvexity assumptions. This formulation removes several omissions in an earlier second-order primal dual pair introduced by Devi [Symmetric duality for nonli

Multiobjective symmetric duality with co

Multiobjective symmetric duality with cone constraints

✍ Do Sang Kim; Ye Boon Yun; Won Jung Lee 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 447 KB

We formulate a pair of multiobjective symmetric dual programs for pseudo-invex functions and arbitrary cones. Our model is unifying the Wolfe vector symmetric dual and the Mond-Weir vector symmetric dual models. We establish the weak, strong, converse and self duality theorems for our pair of dual m

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.

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

Nondifferentiable multiobjective symmetr

Nondifferentiable multiobjective symmetric duality with -convexity over cones

✍ Himani Saini; T.R. Gulati 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 224 KB

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