Optimality conditions and the basic constraint qualification for quasiconvex programming

In this paper, we consider optimality conditions and a constraint qualification for quasiconvex programming. For this purpose, we introduce a generator and a new subdifferential for quasiconvex functions by using Penot and Volle’s theorem.