On a constraint qualification in a nondifferentiable programming problem

A mathematical programming problem with an objective function containing the square root of a positive semidefinite quadratic form has been considered by Mond. In order to use a transposition theorem of Eisenberg, Mond introduces a complicated constraint qualification. In this note we give a simple geometric characterization to this constraint qualification and show that it is implied by the generalized Slater constraint qualification.