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

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:
Nondifferentiable mathematical programming - Converse duality - Higher-order dual models
Online Access:http://hdl.handle.net/20.500.11937/43295

Similar Items

Similar Items