On the Relation between Constant Positive Linear Dependence Condition and Quasinormality Constraint Qualification

  • R. Andreani
  • J. M. Martinez
  • M. L. Schuverdt
Technical Note

DOI: 10.1007/s10957-004-1861-9

Cite this article as:
Andreani, R., Martinez, J.M. & Schuverdt, M.L. J Optim Theory Appl (2005) 125: 473. doi:10.1007/s10957-004-1861-9


The constant positive linear dependence (CPLD) condition for feasible points of nonlinear programming problems was introduced by Qi and Wei (Ref. 1) and used in the analysis of SQP methods. In that paper, the authors conjectured that the CPLD could be a constraint qualification. This conjecture is proven in the present paper. Moreover, it is shown that the CPLD condition implies the quasinormality constraint qualification, but that the reciprocal is not true. Relations with other constraint qualifications are given.


Nonlinear programmingconstraint qualificationsCPLD conditionquasinormality

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • R. Andreani
    • 1
  • J. M. Martinez
    • 2
  • M. L. Schuverdt
    • 3
  1. 1.Associate Professor, IMECC-UNICAMPCampinas SPBrazil
  2. 2.Professor, IMECC-UNICAMPCampinas SPBrazil
  3. 3.PhD Student,IMECC-UNICAMPCampinas SPBrazil