Optimality Conditions for a Class of Generalized Convex Programming

Optimization Conditions are ones of the most fundainental and the heart contents of the Mathematical Programming theory.In this Paper,We discussed the optimization conditions for a class of convex Programming in the sense of(h,φ).With the Ben-Tal generalized algebraic operation of(2),we obtained some necessary and sufficient conditions for the class of generalized convex programming,and the results generalize the corresponding ones for the convex Programming.