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

0.00 Avg rating—0 Votes
Article ID: iaor2012321
Volume: 6
Issue: 1
Start Page Number: 11
End Page Number: 15
Publication Date: Jan 2012
Journal: Optimization Letters
Authors: ,
Keywords: duality
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.