期刊文献+

“求线性规划问题可行基的一种方法”的注记 被引量:2

Notes on"A Method to Solve the Feasible Basis of LP"
下载PDF
导出
摘要 文[2]通过两个反例的计算,认为文[1]所提出的求LP可行基的方法有不妥之处,并对[1]的方法中主要步骤作了修正。本文对[1]的算法中轴心项的选取作进一步说明,对[2]中所提出的反例以[1]中算法进行计算与[2]对比分析,说明[2]中的反例并不成立。 In paper[2], the author finds the algorithm "A Method to Solve the Feasible Basis of LP " in paper[ 1 ] somewhat inappropriate, by giving two opposite examples. And it also "corrects" the main step in the algorithm mentioned. This paper gives a further explanation of the paper [ 1 ]and proves the examples in [2] are untenable.
作者 吴延东
出处 《运筹与管理》 CSCD 2005年第4期52-54,共3页 Operations Research and Management Science
关键词 运筹学 可行基 旋转迭代 轴心项 operations research feasible basis twiddle iterative pivot element
  • 相关文献

参考文献8

二级参考文献15

  • 1刘肇t 郭元裕.灌排工程系统分析[M].北京:水利电力出版社出版,1988.. 被引量:1
  • 2[3]Klee,Minty.How good is the simplex algonthm[J].O.Shisha(ed.)Inequalities,1972,3:21-32. 被引量:1
  • 3吴启乾.对应用哈契杨算法的改进[J].数值计算与计算机应用,1985,(1):33-41. 被引量:1
  • 4Kantorovich L. Mathematical methods in the organization and planning of production[J]. Management Science, 1958, 6:366-422. 被引量:1
  • 5Dantzig G B. Maximization of a linear function of variables subject to linear inequalities[A]. Koopmans T C. Activity analysis of production and allocation[C]. New York: John Wildy and Son, 1951:339-347. 被引量:1
  • 6Khachiyan L G. A polynomial algorithm in linear programming[J]. Soviet Mathematics Doslady, 1979, 20: 191-194. 被引量:1
  • 7Karmarkar N. A new polynomial algorithm for linear programming[J]. Combinatorica, 1984, 4: 373-395. 被引量:1
  • 8Smale S. Mathematical problems for the next century[J]. The Mathematical Intelligence, 1998, 20: 7-15. 被引量:1
  • 9邓成梁.运筹学的原理和方法[M]华中理工大学出版社,1996. 被引量:1
  • 10钱颂迪.运筹学[M]清华大学出版社,1990. 被引量:1

共引文献43

同被引文献16

  • 1Ping-qi Pan (Department of Applied Mathematics, Southeast University, Nanjing 210096, China.).PRIMAL PERTURBATION SIMPLEX ALGORITHMS FOR LINEAR PROGRAMMING[J].Journal of Computational Mathematics,2000,18(6):587-596. 被引量:5
  • 2唐建国.线性规划的符号跟踪算法[J].运筹与管理,2005,14(3):55-59. 被引量:3
  • 3唐建国.线性规划的目标函数最速递减算法[J].运筹与管理,2005,14(4):55-59. 被引量:9
  • 4钱颂迪 顾基发 等.运筹学[M].清华大学出版社,1990.. 被引量:171
  • 5Pan pingqi.A variant of the dual pivoting rule in linear programming[J].Journal of Information & Optimization Sciences,1994,15(3):405-413. 被引量:1
  • 6Pan pingqi.Composite phase-1 approach without measuring infeasibility[R].Proceedings of Second National Symposium on Mathematical Programming,Xidian University Press,Xian,China,1994.359-364. 被引量:1
  • 7Pan pingqi.On developments of pivot algorithms for linear programming[R].Proceedings of the Sixth National Conference of Operations Research Society of China (Changsha,China,October 10-15,2000),Global-Link Publishing Company,2000,Hong Kong,120-129. 被引量:1
  • 8Guerrero-García,Santos-Palomo.Phase I cycling under the most-obtuse-angle pivot rule[J].European Journal of Operational Research,2005,167:20-27. 被引量:1
  • 9Murtagh,Saunders.MINOS 5.5 user's guide[Z].Technical Report SOL 83-20R,Dept.of Operations Research,Stanford University,Stanford,1998. 被引量:1
  • 10夏少刚.运筹学:经济优化方法与模型[M].北京:清华大学出版社,1995.100-101. 被引量:1

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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