Title
On duality for mathematical programs with vanishing constraints
Abstract
In this paper, we formulate and study Wolfe and Mond–Weir type dual models for a difficult class of optimization problems known as the mathematical programs with vanishing constraints. We establish the weak, strong, converse, restricted converse and strict converse duality results under the assumptions of convexity and strict convexity between the primal mathematical program with vanishing constraints and the corresponding Wolfe type dual. We also derive the weak, strong, converse, restricted converse and strict converse duality results between the primal mathematical program with vanishing constraints and the corresponding Mond–Weir type dual under the assumptions of pseudoconvex, strict pseudoconvex and quasiconvex functions.
Year
DOI
Venue
2016
https://doi.org/10.1007/s10479-015-1814-8
Annals of Operations Research
Keywords
Field
DocType
Wolfe dual,Mond–Weir dual,Duality results,Mathematical programs with vanishing constraints,Generalized convexity
Converse,Mathematical optimization,Duality gap,Convexity,Weak duality,Quasiconvex function,Duality (optimization),Strong duality,Wolfe duality,Mathematics
Journal
Volume
Issue
ISSN
243
1
0254-5330
Citations 
PageRank 
References 
3
0.42
18
Authors
3
Name
Order
Citations
PageRank
S. K. Mishra1288.44
Vinay Singh251.17
Vivek Laha3153.39