摘要
最优性条件是数学规划理论中最基本和核心的内容之一。本文讨论了由一类（ｈ，φ）－凸函数所构成的广义凸规划的最优性条件。利用文〔２〕中定义的Ｂｅｎ－Ｔａｌ广义代数运算，本文得到了这类广义凸规划的Ｋｕｈｎ－Ｔｕｃｋｅｒ充分条件和必要条件。
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.
出处
《南昌航空工业学院学报》
CAS
1999年第1期48-52,共5页
Journal of Nanchang Institute of Aeronautical Technology（Natural Science Edition）
关键词
广义凸规划
广义代数运算
最优性条件
数学规划
Optimization theory
sufficient conditions
necessary conditions
generalized convex programming
Ben Tal generalized algebraic operation.
