.png){kind=icon}
返回
A note on an improved initial basis for the simplex algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2006.02.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this note, we show a mathematical error in paper (An improved initial basis for the simplex algorithm (Junior HV, Lins MPE. An improved initial basis for the simplex algorithm. Computers and Operations Research 2005; 32: 1983-1993), and then offer a modified method using LU decomposition. Our preliminary computational results are very favorable. (C) 2006 Elsevier Ltd. All rights reserved.
Keyword:
linear programming
simplex algorithm
basis
LU decomposition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
.png){kind=icon}
