Approximate solutions to nonsmooth multiobjective programming problems
Minimax theory and its applications, Tome 7 (2022) no. 1
We consider a multiobjective mathematical programming problem with inequality and equality constraints, where all functions are locally Lipschitz. An approximate strong Karush-Kuhn-Tucker (ASKKT for short) condition is defined and we show that every local efficient solution is an ASKKT point without any additional condition. Then a nonsmooth version of cone-continuity regularity isdefined for this kind of problem. It is revealed that every ASKKT point under the cone-continuity regularity is a strong Karush-Kuhn-Tucker (SKKT for short) point. Correspondingly, the ASKKTs and the cone-continuity property are defined and the relations between them are investigated.
Mots-clés :
Mathematical programming, optimality conditions, nonlinear programming, nonsmooth analysis and approximate conditions
@article{MTA_2022_7_1_a4,
author = {Mohammad Golestani},
title = {Approximate solutions to nonsmooth multiobjective programming problems},
journal = {Minimax theory and its applications},
year = {2022},
volume = {7},
number = {1},
zbl = {1493.90164},
url = {http://geodesic.mathdoc.fr/item/MTA_2022_7_1_a4/}
}
Mohammad Golestani. Approximate solutions to nonsmooth multiobjective programming problems. Minimax theory and its applications, Tome 7 (2022) no. 1. http://geodesic.mathdoc.fr/item/MTA_2022_7_1_a4/