Constraint qualifications in quasidifferentiable optimization

The classical linearization procedure for differentiable nonlinear programming problems can be naturally generalized to the quasidifferentiable case. As in the classical case so-called constraint qualifications have to be imposed on the constraint functions in order to ensure that optimality of a feasible point implies optimality of the nullvector for the corresponding ‘quasilinearized’ problem. The authors present various constraint qualifications in a unified setting, propose a new one, and investigate the relations between these conditions.