首页 | 本学科首页   官方微博 | 高级检索  
     


Convergence behavior of decomposition algorithms for linear programs
Authors:James K. Ho
Affiliation:Management Science Program, College of Business Administration, The University of Tennessee, Knoxville, TN 37996, USA
Abstract:This paper discusses plausible explanations of the somewhat folkloric, ‘tailing off’ convergence behavior of the Dantzig-Wolfe decomposition algorithm for linear programs. Is is argued that such beahvior may be used to numerical inaccuracy. Procedures to identify and mitigate such difficulties are outlined.
Keywords:linear programming  decomposition algorithms  convergence behavior  large scale systems
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号