TY - JOUR
AU - Tadeusz Antczak
AU - Vinay Singh
AU - Solomon Lalmalsawma
PY - 2024/04/13
Y2 - 2024/07/22
TI - Optimality conditions for (h, φ)-subdifferentiable multiobjective programming problems with G-type I functions
JF - Statistics, Optimization & Information Computing
JA - Stat., optim. inf. comput.
VL - 12
IS - 4
SE - Research Articles
DO - 10.19139/soic-2310-5070-1930
UR - http://iapress.org/index.php/soic/article/view/1930
AB - In this paper, using generalized algebraic operations introduced by Ben-Tal [7], we introduce new classes of (h,φ)-subdifferentiable functions, called (h,φ)-G-type I functions and generalized (h,φ)-G-type I functions. Then, we consider a class of nonconvex (h, φ)-subdifferentiable multiobjective programming problems with locally Lipschitz functions in which the functions involved belong to aforesaid classes of (h, φ)-subdifferentiable nonconvex functions. For such (h, φ)-subdifferentiable vector optimization problems, we prove the sufficient optimality conditions for a feasible solution to be its (weak) Pareto solution. Further, we define a vector dual problem in the sense of Mond-Weir for the considered (h, φ)-subdifferentiable multiobjective programming problem and we prove several duality theorems for the aforesaid (h, φ)-subdifferentiable vector optimization problems also under (h, φ)-G-type I hypotheses.
ER -