✦ LIBER ✦

Nondifferentiable multiobjective symmetric duality with -convexity over cones

✍ Scribed by Himani Saini; T.R. Gulati

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 224 KB
Volume: 74
Category: Article
ISSN: 0362-546X
DOI: 10.1016/j.na.2010.10.028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nondifferentiable multiobjective symmetr

Nondifferentiable multiobjective symmetric dual programs over cones

✍ T.R. Gulati; Geeta; S.K. Gupta 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Wolfe and Mond-Weir type nondifferentiable multiobjective symmetric dual programs are formulated over arbitrary cones and appropriate duality theorems are established under K -preinvexity/K -convexity/pseudoinvexity assumptions.

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

Multiobjective mixed symmetric duality i

Multiobjective mixed symmetric duality involving cones

✍ I. Ahmad; Z. Husain 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 527 KB

A pair of multiobjective mixed symmetric dual programs is formulated over arbitrary cones. Weak, strong, converse and self-duality theorems are proved for these programs under K -preinvexity and K -pseudoinvexity assumptions. This mixed symmetric dual formulation unifies the symmetric dual formulati

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

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.

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.