✦ LIBER ✦

Second-order duality in nondifferentiable minmax programming involving type-I functions

✍ Scribed by I. Ahmad; Z. Husain; Sarita Sharma

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 199 KB
Volume: 215
Category: Article
ISSN: 0377-0427
DOI: 10.1016/j.cam.2007.03.022

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Second-order duality in nondifferentiabl

Second-order duality in nondifferentiable fractional programming

✍ I. Ahmad; Z. Husain; S. Al-Homidan 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 227 KB

On Second-Order Symmetric Duality in Non

On Second-Order Symmetric Duality in Nondifferentiable Programming

✍ S.H. Hou; X.M. Yang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 70 KB

This article is concerned with a pair of second-order symmetric dual non-differentiable programs and second-order F-pseudo-convexity. We establish the weak and the strong duality theorems for the new pair of dual models under the F-pseudo-convexity assumption. Several known results including Mond an

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

Optimality conditions and duality for no

Optimality conditions and duality for nondifferentiable multiobjective programming problems involving d-r-type I functions

✍ Tadeusz Antczak 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 753 KB

weak) Pareto optimal solution d-r-type I objective and constraint functions Optimality conditions Duality a b s t r a c t In this paper, new classes of nondifferentiable functions constituting multiobjective programming problems are introduced. Namely, the classes of d-r-type I objective and constr

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.

Wolfe-Type Duality Involving (B, η)

Wolfe-Type Duality Involving (B, η)-Invex Functions For a Minmax Programming Problem

✍ C.R. Bector 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 165 KB

A sufficient optimality theorem is proved for a certain minmax programming Ž . problem under the assumptions of proper b, -invexity conditions on the functions involved in the objective and in the constraints. Next a dual is presented for such a problem and duality theorems relating the primal and t