On sufficiency and duality for multiobjective programming problems using convexificators
Filomat, Tome 36 (2022) no. 9, p. 3119
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
In this paper, we consider a multiobjective programming problem with inequality and set constraints. We derive sufficient conditions for the optimality of a feasible point under generalized invexity assumptions in terms of convexificators. We give an example to illustrate that the concept of invexity in terms of convexificators is weaker than invexity in terms of other subdifferentials. We formulate Wolfe and Mond-Weir type duals for the nonsmooth multiobjective programming problem with inequality and set constraints in terms of convexificators. We establish weak, strong, converse, restricted converse and strict converse duality results under the assumptions of invexity and strict invexity using convexificators between the primal and the Wolfe dual. We derive the respective results between the primal and the Mond-Weir dual under the assumptions of generalized pseudoinvexity, strict pseudoinvexity and quasiinvexity in terms of convexificators. We also derive the relationship between a weak vector saddle-point and a weakly efficient solution of the multiobjective programming problem.
Classification :
90C26, 90C29, 90C30, 90C46, 49N15
Keywords: Convexificators, Duality, Generalized convexity, Multiobjective programming, Nonsmooth analysis, Saddle-point
Keywords: Convexificators, Duality, Generalized convexity, Multiobjective programming, Nonsmooth analysis, Saddle-point
Pushkar Jaisawal; Vivek Laha. On sufficiency and duality for multiobjective programming problems using convexificators. Filomat, Tome 36 (2022) no. 9, p. 3119 . doi: 10.2298/FIL2209119J
@article{10_2298_FIL2209119J,
author = {Pushkar Jaisawal and Vivek Laha},
title = {On sufficiency and duality for multiobjective programming problems using convexificators},
journal = {Filomat},
pages = {3119 },
year = {2022},
volume = {36},
number = {9},
doi = {10.2298/FIL2209119J},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL2209119J/}
}
TY - JOUR AU - Pushkar Jaisawal AU - Vivek Laha TI - On sufficiency and duality for multiobjective programming problems using convexificators JO - Filomat PY - 2022 SP - 3119 VL - 36 IS - 9 UR - http://geodesic.mathdoc.fr/articles/10.2298/FIL2209119J/ DO - 10.2298/FIL2209119J LA - en ID - 10_2298_FIL2209119J ER -
Cité par Sources :