期刊文献+

对偶单纯形法的一个注记 被引量:3

A Kind of Comprehension About Dual Simplex Algorithm
下载PDF
导出
摘要 针对运筹学教学难点——对偶单纯形法,通过讨论证明了单纯形表中的列可以视为对偶问题的非基变量的检验数,并讨论了在对偶单纯形法迭代过程中的进基变量与出基变量的确定原则亦如同在单纯形法迭代过程中进基变量与出基变量的确定原则,得出结论是对偶单纯形法本质上就是单纯形法,只是在运用对偶单纯形法解线性规划时需要将单纯形表旋转90°。 With respect to dual simplex algorithm which is always a difficult part in teaching process, in this paper by discussion, we prove that the content of the column in simplex table should be considered as the checking number of the nonbasic variable in dual problem correspondingly; and in the iterative process of dual simplex algorithm, the principle of confirming the entering variable and the leaving variable, which is the same as the iterative process of simplex algorithm. The conclusion is dual simplex algorithm in itself is simplex algorithm; it only needs rotate the simplex table 90° to deal with linear programming problem while using dual simplex algorithm.
作者 陈岩 陈侠
出处 《沈阳师范大学学报(自然科学版)》 CAS 2009年第3期277-279,共3页 Journal of Shenyang Normal University:Natural Science Edition
基金 辽宁省教育厅高等学校科学研究项目(20080506) 沈阳工业大学青年学术骨干基金
关键词 单纯形法 对偶单纯形法 单纯形表 simplex algorithm dual simplex algorithm simplex table
  • 相关文献

参考文献6

二级参考文献28

  • 1Burke J,Xu S.A non-interior predict corrector path following algorithm for the monotone linear complementarity problem[J].Math Program, 2000, 87 : 113-130.
  • 2Chen B,Xiu N.Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity[J],J Optim Theory Appl,2001,108:317-332.
  • 3Chen X,Ye Y.On smoothing methods for the matrix linear complementarity problem[J].SIMA J Optim, 2000,11 : 341-363.
  • 4Engelke S,Kanzow C,Improved smoothing-type methods for the solution of linear programs[J].Numer Math,2002,90:487-507.
  • 5Huang Z H.Sufficient conditions on nonemptiness and boundedness of the solution set of the function nonlinear complementarity problems[J].Oper Res, 2002, 30: 202-210.
  • 6Huang Z H.Locating a maximally eomplementary solution of the monotone NCP by using non-interior-point smoothing algorithms[J]. Math Methods Oper Res,2005,61:41-55.
  • 7Huang Z H.The global linear and local quadratic convergence of a noninterior continuation algorithm for the LCP[J].IMA J Mumer Anal, 2005,25 : 670-684.
  • 8Huang Z H,Sun J.A non-intinuation algorithm for the Po or P, LCP with strong global loeal eonvergenee properties[J].Appl Math Optim, 2005,26 : 237-262.
  • 9Qi L,Sun D,Zhou G.A new look at smoothing Newton methods for nonlinear eomplementarity problems and box eonstrained variational inequality problems[J].Math Program, 2000,87:1-35.
  • 10Ye Y,Todd M J,Mizuno S.An O(√n L)-iteration homogeneous and self-dual linear programming algorithm[J].Math Oper Res, 1994,19:53-67.

共引文献27

同被引文献17

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部