4.2 Article

Relaxed Constant Positive Linear Dependence Constraint Qualification for Disjunctive Systems

Journal

SET-VALUED AND VARIATIONAL ANALYSIS
Volume 31, Issue 3, Pages -

Publisher

SPRINGER
DOI: 10.1007/s11228-023-00683-2

Keywords

Constraint qualifications; RCPLD; Piecewise RCPLD; Error bounds; Disjunctive program; Ortho-disjunctive program; Complementarity system; Vanishing system; Switching system

Ask authors/readers for more resources

This paper introduces the relaxed constant positive linear dependence constraint qualification (RCPLD) for disjunctive systems, which are composed of multiple polyhedral convex sets. The RCPLD introduced in this paper is weaker but still a constraint qualification compared to the one introduced for a more general system. To obtain the local error bound for the disjunctive system, the piecewise RCPLD is proposed, under which the error bound property holds under certain conditions. The results are further applied to specific types of disjunctive programs, such as MPEC, MPVC, and MPSC, achieving error bound properties and introducing new constraint qualifications.
The disjunctive system is a system involving a disjunctive set which is the union of finitely many polyhedral convex sets. In this paper, we introduce a notion of the relaxed constant positive linear dependence constraint qualification (RCPLD) for the disjunctive system. For a disjunctive system, our notion is weaker than the one we introduced for a more general system recently (J. Glob. Optim. 2020) and is still a constraint qualification. To obtain the local error bound for the disjunctive system, we introduce the piecewise RCPLD under which the error bound property holds if all inequality constraint functions are subdifferentially regular and the rest of the constraint functions are smooth. We then specialize our results to the ortho-disjunctive program, which includes the mathematical program with equilibrium constraints (MPEC), the mathematical program with vanishing constraints (MPVC) and the mathematical program with switching constraints (MPSC) as special cases. For MPEC, we recover MPEC-RCPLD, an MPEC variant of RCPLD and propose the MPEC piecewise RCPLD to obtain the error bound property. For MPVC, we introduce new constraint qualifications MPVC-RCPLD and the piecewise RCPLD, which also implies the local error bound. For MPSC, we show that both RCPLD and the piecewise RCPLD coincide and hence it leads to the local error bound.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available