Semidefinite Multiobjective Mathematical Programming Problems with Vanishing Constraints Using Convexificators

In this paper, we establish Fritz John stationary conditions for nonsmooth, nonlinear, semidefinite, multiobjective programs with vanishing constraints in terms of convexificator and introduce generalized Cottle type and generalized Guignard type constraints qualification to achieve strong S—stationary conditions from Fritz John stationary conditions. Further, we establish strong S—stationary necessary and sufficient conditions, independently from Fritz John conditions. The optimality results for multiobjective semidefinite optimization problem in this paper is related to two recent articles by Treanta in 2021. Treanta in 2021 discussed duality theorems for special class of quasiinvex multiobjective optimization problems for interval-valued components. The study in our article can also be seen and extended for the interval-valued optimization motivated by Treanta (2021). Some examples are provided to validate our established results.

Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints

In this paper, we study the duality theorems of a nondifferentiable semi-infinite interval-valued optimization problem with vanishing constraints (IOPVC). By constructing the Wolfe and Mond–Weir type dual models, we give the weak duality, strong duality, converse duality, restricted converse duality, and strict converse duality theorems between IOPVC and its corresponding dual models under the assumptions of generalized convexity.

Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints

In this paper, the class of differentiable semi-infinite multiobjective programming problems with vanishing constraints is considered. Both Karush–Kuhn–Tucker necessary optimality conditions and, under appropriate invexity hypotheses, sufficient optimality conditions are proved for such nonconvex smooth vector optimization problems. Further, vector duals in the sense of Mond–Weir are defined for the considered differentiable semi-infinite multiobjective programming problems with vanishing constraints and several duality results are established also under invexity hypotheses.