Necessary and Sufficient Conditions in Smooth Programming with Generalized Convexity  

可微广义凸规划的最优充要条件(英文)

作　　者：孙清滢[1] 叶留青[2] 

机构地区：[1]石油大学数学系,山东东营257061 [2]焦作教育学院数学系,河南焦作454152

出　　处：《Chinese Quarterly Journal of Mathematics》2000年第4期33-37,共5页数学季刊（英文版）

摘　　要：Hanson and Mond have grven sets of necessary and sufficient conditions for optimality in constrained optimization by introducing classes of generalized functions, called type Ⅰ functions. Recently, Bector definded univex functions, a new class of functions that unifies several concepts of generalized convexity. In this paper, additional conditions are attached to the Kuhn Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications.

关 键 词：necessary and sufficient conditions generalized convexity nonlinear programming multiobjective programming type Ⅰ functions 

分 类 号：O221.2[理学—运筹学与控制论]