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 <inlin...
Main Authors: | Kin Keung Lai, Mohd Hassan, Sanjeev Kumar Singh, Jitendra Kumar Maurya, Shashi Kant Mishra |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-12-01
|
Series: | Fractal and Fractional |
Subjects: | |
Online Access: | https://www.mdpi.com/2504-3110/6/1/3 |
Similar Items
-
Saddle point criteria for semidefinite semi-infinite convex multiobjective optimization problems
by: Laha Vivek, et al.
Published: (2022-01-01) -
On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
by: Sy-Ming Guu, et al.
Published: (2017-11-01) -
On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints
by: Nath Triloki, et al.
Published: (2019-01-01) -
Multiobjective Convex Optimization in Real Banach Space
by: Kin Keung Lai, et al.
Published: (2021-11-01) -
On optimality and duality for multiobjective interval-valued programming problems with vanishing constraints
by: B. Japamala Rani, et al.
Published: (2023-09-01)