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

Higher-order symmetric duality in multiobjective programming problems under higher-order invexity

โœ Scribed by S.K. Padhan; C. Nahak

Book ID
113439653
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
207 KB
Volume
218
Category
Article
ISSN
0096-3003

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Higher-Order Generalized Invexity and Du
Higher-Order Generalized Invexity and Duality in Mathematical Programming
โœ Shashi K. Mishra; Norma G. Rueda ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 124 KB

In this paper, we introduce the concepts of higher-order type-I, pseudo-type-I, and quasi-type-I functions and establish various higher-order duality results involving these functions.

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

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