解型线性双层规划的Lagrange对偶规划  

LAGRANGE DUALITY PROGRAMMING FOR SOLUTION-TYPE LINEAR BILEVEL PROGRAMMING

作　　者：解枝星[1] 谢铁军[1] 

机构地区：[1]北京科技大学应用科学学院,北京100083

出　　处：《北京工商大学学报（自然科学版）》2008年第4期74-77,共4页Journal of Beijing Technology and Business University:Natural Science Edition

摘　　要：讨论了一类解型线性双层规划的Lagrange对偶规划及其鞍点条件,并讨论了鞍点条件与K-T条件的关系.In this paper, we consider the Lagrange duality programming for solution-type linear bilevel programming and saddle condition, and we consider the relation between saddle condition and K-T condition.

关 键 词：解型线性双层规划 Lagrange对偶规划 鞍点条件 

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