| 线性规划问题的算法综述 |
| |
| 引用本文： | 曾梅清,田大钢.线性规划问题的算法综述[J].科学技术与工程,2010,10(1). |
| |
| 作者姓名： | 曾梅清 田大钢 |
| |
| 作者单位： | 上海理工大学管理学院,上海,200093 |
| |
| 摘 要： | 综述了线性规划问题近年来的算法研究最新进展,给出了一些典型算法的求解思想及其时间复杂度,综合分析了各算法的优缺点。并为后续研究提供了一个借鉴方向。
|
| 关 键 词： | 线性规划问题 项式时间 自协调 算法 |
| 收稿时间： | 8/23/2009 2:47:38 PM |
| 修稿时间： | 9/18/2009 5:46:33 PM |
The review to the algorithm of linear programming problems |
| |
| zeng meiqing and TIAN dagang.The review to the algorithm of linear programming problems[J].Science Technology and Engineering,2010,10(1). |
| |
| Authors: | zeng meiqing and TIAN dagang |
| |
| Institution: | The University of Shanghai for Science and Technology/a>;Shanghai 200093/a>;P.R.China |
| |
| Abstract: | A literature review is introduced the recent study of the linear problems in summary.Meanwhile the solving idea and time-complexity of some classical algorithms is introduced.The advantages and disadvantages are analyzed too.A referenced direction for the study of the linear programming will be provided. |
| |
| Keywords: | linear programming problems polynomial time self-concordant algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
| 点击此处可从《科学技术与工程》下载免费的PDF全文 |
