A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming

We consider in this paper Mond–Weir type higher-order dual models in nondifferentiable mathematical programming introduced by Mishra and Rueda (2002, J. Math. Anal. Appl. 272, 496–506). We give a converse duality theorem on Mond-Weir type higher-order dual model under mild assumptions.

Bibliographic Details
Main Authors: Yang, X., Teo, Kok Lay
Format: Journal Article
Published: Springer Verlag 2010
Subjects:
Online Access:http://hdl.handle.net/20.500.11937/43295
_version_ 1848756651446763520
author Yang, X.
Teo, Kok Lay
author_facet Yang, X.
Teo, Kok Lay
author_sort Yang, X.
building Curtin Institutional Repository
collection Online Access
description We consider in this paper Mond–Weir type higher-order dual models in nondifferentiable mathematical programming introduced by Mishra and Rueda (2002, J. Math. Anal. Appl. 272, 496–506). We give a converse duality theorem on Mond-Weir type higher-order dual model under mild assumptions.
first_indexed 2025-11-14T09:15:35Z
format Journal Article
id curtin-20.500.11937-43295
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T09:15:35Z
publishDate 2010
publisher Springer Verlag
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-432952017-09-13T15:52:27Z A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming Yang, X. Teo, Kok Lay Nondifferentiable mathematical programming - Converse duality - Higher-order dual models We consider in this paper Mond–Weir type higher-order dual models in nondifferentiable mathematical programming introduced by Mishra and Rueda (2002, J. Math. Anal. Appl. 272, 496–506). We give a converse duality theorem on Mond-Weir type higher-order dual model under mild assumptions. 2010 Journal Article http://hdl.handle.net/20.500.11937/43295 10.1007/s11590-010-0247-1 Springer Verlag restricted
spellingShingle Nondifferentiable mathematical programming - Converse duality - Higher-order dual models
Yang, X.
Teo, Kok Lay
A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
title A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
title_full A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
title_fullStr A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
title_full_unstemmed A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
title_short A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
title_sort converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
topic Nondifferentiable mathematical programming - Converse duality - Higher-order dual models
url http://hdl.handle.net/20.500.11937/43295