返回
An efficient simplex type algorithm for sparse and dense linear programs
DOI:10.1016/S0377-2217(02)00400-9.png)
摘要
En 中文
We present a big-M method for solving general linear programming problems with a recently developed exterior point simplex algorithm (EPSA). We also provide intuitive motivations to EPSA. We describe major steps in implementing EPSA for large-scale linear programming. Our implementation was carried out under the MATLAB environment. This algorithm seems to be more efficient than the classical primal simplex algorithm (PSA), employing Dantzig's rule. Preliminary computational studies on randomly generated sparse and dense small and medium linear programs support this belief. In particular, EPSA is up to 10 times faster than PSA on medium size linear programs. This translates into corresponding savings in CPU time. Although the computational effort required in each step of EPSA requires more time compared to an iteration step of PSA, the improvement of EPSA comes from the fact that it requires adequately less iterations than PSA. Moreover, as the problem size increases and the problem density decreases, EPSA gets relatively faster. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
linear programming
simplex type algorithms
big-M method
algorithm evaluation
numerical experiments
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Similar effects of lysine deficiency in muscle biochemical characteristics of fatty and lean piglets1瘦猪肉和肥猪肉幼猪肌肉生化特性的赖氨酸缺乏相似效应1
The solidstate fermentation technology of Astragalus using Aspergillus application in laying hens黄芪的固态发酵技术及其在产蛋鸡中的应用(Aspergillus)

