不可微B-凸多目标规划的Benson真有效解

Benson′s Proper Efficient Solutions of Nondifferentiable Multiobjective Programming with B vexity

对不可微Ｂ－凸多目标规划（ＶＰ）的Ｂｅｎｓｏｎ真有效解展开讨论．当目标函数和约束函数都为局部Ｌｉｐｓｃｈｉｔｚ时，利用Ｃｌａｒｋｅ次微分给出了问题（ＶＰ）关于Ｂｅｎｓｏｎ真有效解的最优性必要条件和充分条件、鞍点定理及Ｍｏｎｄ－Ｗｅｉｒ型对偶．

Benson′s proper efficiency of nondifferentiable multiobjective programming with B vexity (VP) is descussed.The necessary and sufficient conditions for optimality of the Benson′s proper efficiency,the saddle point theorem and the correspondence Mond Weir dual problem as well as the dual theorems in (VP) are introduced by means of the Clarke′s generalized subdifferential,when the objective functions and the constrained functions are local Lipschitz functions.