Mond-Weir Duality Results for Nondifferentiable Mathematical Programming with Vanishing Constraints
Abstract
In this paper, we introduce a Mond-Weir dual problem for opti-
mization problems with vanishing constraints (MPVC) dened by nondier-
entiable locally Lipschitz functions. Then, we present the weak, the strong,
the converse, the restricted converse, and the strict converse duality results
for this new dual problem. This article can be considered as an extension of
Mishra et al. (Ann. Oper. Res. 243(1):249{272, 2016), and a supplement of
Gobadzadeh et al. (J. Math. Ext 9(7):1{17, 2022).
mization problems with vanishing constraints (MPVC) dened by nondier-
entiable locally Lipschitz functions. Then, we present the weak, the strong,
the converse, the restricted converse, and the strict converse duality results
for this new dual problem. This article can be considered as an extension of
Mishra et al. (Ann. Oper. Res. 243(1):249{272, 2016), and a supplement of
Gobadzadeh et al. (J. Math. Ext 9(7):1{17, 2022).
Keywords
Dual problem, Vanishing constraints, Clarke subdifferential, Duality results.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.