Kuhn-Tucker条件与线性规划的对偶性  

Kuhn-Tucker Condition and Duality of Liner Programming

作　　者：全生寅[1] 

机构地区：[1]青海大学基础部,西宁810016

出　　处：《数学的实践与认识》2006年第1期253-256,共4页Mathematics in Practice and Theory

摘　　要：证明了线性规划的K uhn-Tucker条件蕴含着它的对偶问题,解释了L agrange乘子的意义.进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系.This Paper prove that Kuhn-Tucker Condition of linear programming imply its dual problem, and explain the significance of Lagrange multiplier. Futhemore, the relation between complementary slackness in Kuhn-Tucker Condition and complementary slack theorem on dual linear programming has been showed.

关 键 词：数学规划 KUHN-TUCKER条件 LAGRANGE乘子 线性规划 对偶问题 对偶线性规划 对偶性 K-T条件 松驰性 互补 

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