一类广义凸规划的最优性条件
Optimality Conditions for a Class of Generalized Convex Programming
-
摘要: 最优性条件是数学规划理论中最基本和核心的内容之一.本文讨论了由一类(h,φ)-凸函数所构成的广义凸规划的最优性条件.利用文〔2〕中定义的Ben-Tal广义代数运算,本文得到了这类广义凸规划的Kuhn-Tucker充分条件和必要条件,所得结果推广了通常凸规划相应的结论.Abstract: 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.