.png){kind=icon}
返回
Computational aspects of linear programming Simplex method
.png){kind=icon}
PRE
AI
DOI：10.1016/S0965-9978(00)00022-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, the Simplex method is re-examined from the computational view points. Efficient numerical implementation for the Simplex procedure is suggested. Special features of artificial variables, and variables with unrestriction in signs are exploited to reduce the computational efforts, and computer memory requirement. The developed Simplex code has been tested on several examples, and its performance has been compared with existing Simplex codes. (C) 2000 Elsevier Science Ltd. All rights reserved.
Keyword:
simplex method
basic variables
non-basic variables
linear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
