Observations of closed cone constraint qualification for quasiconvex programming

In convex programming, constraint qualifications are very important. For example, the closed cone constraint qualification (CCCQ) is the weakest condition for Lagrange duality problem. Also, the CCCQ is a necessary and sufficient condition for a certain duality problem in quasiconvex programming. So, in this paper, we give the definition of the CCCQ for quasiconvex programming and give a sufficient condition of the CCCQ.