American Journal of Operations Research

Volume 11, Issue 6 (November 2021)

ISSN Print: 2160-8830   ISSN Online: 2160-8849

Google-based Impact Factor: 0.84  Citations  

Some Convexificators-Based Optimality Conditions for Nonsmooth Mathematical Program with Vanishing Constraints

HTML  XML Download Download as PDF (Size: 324KB)  PP. 324-337  
DOI: 10.4236/ajor.2021.116020    243 Downloads   893 Views  

ABSTRACT

In this paper, by using the notion of convexificator, we introduce the generalized standard Abadie constraint qualification and the generalized MPVC Abadie constraint qualification, and define the generalized stationary conditions for the nonsmooth mathematical program with vanishing constraints (MPVC for short). We show that the generalized strong stationary is the first order necessary optimality condition for nonsmooth MPVC under the generalized standard Abadie constraint qualification. Sufficient conditions for global or local optimality for nonsmooth MPVC are also derived under some generalized convexity assumptions.

Share and Cite:

Hu, Q. , Zhou, Z. and Chen, Y. (2021) Some Convexificators-Based Optimality Conditions for Nonsmooth Mathematical Program with Vanishing Constraints. American Journal of Operations Research, 11, 324-337. doi: 10.4236/ajor.2021.116020.

Cited by

No relevant information.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.