A constraint qualification in quasidifferentiable programming

One goal in quasidifferentiable optimization is the development of optimality conditions whose hypotheses are independent of the particular choice of quasidifferentials. One such hypothesis, introduced by Demyanov and Rubinov, involves the concept of a pair of convex sets being ‘in a general position’. In this paper, a simple condition that implies the general position hypothesis is presented. This condition is also shown to be a constraint qualification for non-asymptotic Kuhn-Tucker conditions for a quasidifferentiable program.